Base | Representation |
---|---|
bin | 10100001110100010100… |
… | …110110010110011000011 |
3 | 11220212211122221221110210 |
4 | 110032202212302303003 |
5 | 140233211120441024 |
6 | 2542320333525203 |
7 | 202265362301610 |
oct | 24164246626303 |
9 | 4825748857423 |
10 | 1390002515139 |
11 | 496551200a07 |
12 | 1a5485043803 |
13 | a10cc5ba464 |
14 | 4b3c293d507 |
15 | 262555ec129 |
hex | 143a29b2cc3 |
1390002515139 has 32 divisors (see below), whose sum is σ = 2130624331776. Its totient is φ = 789604025760.
The previous prime is 1390002515101. The next prime is 1390002515159. The reversal of 1390002515139 is 9315152000931.
It is not a de Polignac number, because 1390002515139 - 215 = 1390002482371 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1390002515097 and 1390002515106.
It is not an unprimeable number, because it can be changed into a prime (1390002515159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2123854 + ... + 2700140.
It is an arithmetic number, because the mean of its divisors is an integer number (66582010368).
Almost surely, 21390002515139 is an apocalyptic number.
1390002515139 is a deficient number, since it is larger than the sum of its proper divisors (740621816637).
1390002515139 is a wasteful number, since it uses less digits than its factorization.
1390002515139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576975.
The product of its (nonzero) digits is 36450, while the sum is 39.
The spelling of 1390002515139 in words is "one trillion, three hundred ninety billion, two million, five hundred fifteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •