Base | Representation |
---|---|
bin | 1010111010101111101000… |
… | …1111011101011000001111 |
3 | 1120111121021212212120222121 |
4 | 2232223322033131120033 |
5 | 3033134340231402034 |
6 | 41310414414353411 |
7 | 2346166442522341 |
oct | 256537217353017 |
9 | 46447255776877 |
10 | 12004336981519 |
11 | 3909013301253 |
12 | 141a6301bb867 |
13 | 691009089a3c |
14 | 2d70279b1291 |
15 | 15c3d8a5c1b4 |
hex | aeafa3dd60f |
12004336981519 has 2 divisors, whose sum is σ = 12004336981520. Its totient is φ = 12004336981518.
The previous prime is 12004336981489. The next prime is 12004336981531. The reversal of 12004336981519 is 91518963340021.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12004336981519 is a prime.
It is a super-2 number, since 2×120043369815192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12004336981019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6002168490759 + 6002168490760.
It is an arithmetic number, because the mean of its divisors is an integer number (6002168490760).
Almost surely, 212004336981519 is an apocalyptic number.
12004336981519 is a deficient number, since it is larger than the sum of its proper divisors (1).
12004336981519 is an equidigital number, since it uses as much as digits as its factorization.
12004336981519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 52.
The spelling of 12004336981519 in words is "twelve trillion, four billion, three hundred thirty-six million, nine hundred eighty-one thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •