Base | Representation |
---|---|
bin | 11011111111111000… |
… | …11010011010010101 |
3 | 1102210120022112022102 |
4 | 31333330122122111 |
5 | 221241022221031 |
6 | 10523320011445 |
7 | 1041331114136 |
oct | 157774323225 |
9 | 42716275272 |
10 | 15031445141 |
11 | 641394a239 |
12 | 2ab6000b85 |
13 | 1557208a4b |
14 | a2848bc8d |
15 | 5ce9767cb |
hex | 37ff1a695 |
15031445141 has 4 divisors (see below), whose sum is σ = 15045775500. Its totient is φ = 15017114784.
The previous prime is 15031445123. The next prime is 15031445147. The reversal of 15031445141 is 14154413051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14154413051 = 83 ⋅170535097.
It can be written as a sum of positive squares in 2 ways, for example, as 6939723025 + 8091722116 = 83305^2 + 89954^2 .
It is a cyclic number.
It is not a de Polignac number, because 15031445141 - 218 = 15031182997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15031445147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7163606 + ... + 7165703.
It is an arithmetic number, because the mean of its divisors is an integer number (3761443875).
Almost surely, 215031445141 is an apocalyptic number.
It is an amenable number.
15031445141 is a deficient number, since it is larger than the sum of its proper divisors (14330359).
15031445141 is a wasteful number, since it uses less digits than its factorization.
15031445141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14330358.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 15031445141 its reverse (14154413051), we get a palindrome (29185858192).
The spelling of 15031445141 in words is "fifteen billion, thirty-one million, four hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •