Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …1100001100100100101101 |
3 | 1022211110111102020221002221 |
4 | 2103100333030030210231 |
5 | 2311301231244024323 |
6 | 33305022032115341 |
7 | 2063101053065302 |
oct | 223207714144455 |
9 | 38743442227087 |
10 | 10120003111213 |
11 | 3251961a23696 |
12 | 11753a8695b51 |
13 | 585409b91a38 |
14 | 26db4ca450a9 |
15 | 1283a031055d |
hex | 9343f30c92d |
10120003111213 has 2 divisors, whose sum is σ = 10120003111214. Its totient is φ = 10120003111212.
The previous prime is 10120003111201. The next prime is 10120003111291. The reversal of 10120003111213 is 31211130002101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10104750367209 + 15252744004 = 3178797^2 + 123502^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120003111213 - 233 = 10111413176621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120003111513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060001555606 + 5060001555607.
It is an arithmetic number, because the mean of its divisors is an integer number (5060001555607).
Almost surely, 210120003111213 is an apocalyptic number.
It is an amenable number.
10120003111213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120003111213 is an equidigital number, since it uses as much as digits as its factorization.
10120003111213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10120003111213 its reverse (31211130002101), we get a palindrome (41331133113314).
The spelling of 10120003111213 in words is "ten trillion, one hundred twenty billion, three million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •