Base | Representation |
---|---|
bin | 1011001101110000111110… |
… | …0111011011111010100101 |
3 | 1121122211202110210112012012 |
4 | 2303130033213123322211 |
5 | 3104013104423244023 |
6 | 42120500221004005 |
7 | 2411615322652115 |
oct | 263341747337245 |
9 | 47584673715165 |
10 | 12331113103013 |
11 | 3a24660969981 |
12 | 1471a289b3605 |
13 | 6b5a853a1303 |
14 | 308b86d19045 |
15 | 165b61ccb978 |
hex | b370f9dbea5 |
12331113103013 has 2 divisors, whose sum is σ = 12331113103014. Its totient is φ = 12331113103012.
The previous prime is 12331113103003. The next prime is 12331113103037. The reversal of 12331113103013 is 31030131113321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11023150332769 + 1307962770244 = 3320113^2 + 1143662^2 .
It is a cyclic number.
It is not a de Polignac number, because 12331113103013 - 26 = 12331113102949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12331113103013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12331113103003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6165556551506 + 6165556551507.
It is an arithmetic number, because the mean of its divisors is an integer number (6165556551507).
Almost surely, 212331113103013 is an apocalyptic number.
It is an amenable number.
12331113103013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12331113103013 is an equidigital number, since it uses as much as digits as its factorization.
12331113103013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 12331113103013 its reverse (31030131113321), we get a palindrome (43361244216334).
The spelling of 12331113103013 in words is "twelve trillion, three hundred thirty-one billion, one hundred thirteen million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •