Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …011010000100111010101 |
3 | 10221022021021002212120122 |
4 | 100023220123100213111 |
5 | 121204334230204141 |
6 | 2210502441041325 |
7 | 143224264510052 |
oct | 20135033204725 |
9 | 3838237085518 |
10 | 1112001022421 |
11 | 399662650843 |
12 | 15b61aa86245 |
13 | 80b2720a283 |
14 | 3bb6d2b0029 |
15 | 1ddd437464b |
hex | 102e86d09d5 |
1112001022421 has 2 divisors, whose sum is σ = 1112001022422. Its totient is φ = 1112001022420.
The previous prime is 1112001022337. The next prime is 1112001022471. The reversal of 1112001022421 is 1242201002111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1111485232900 + 515789521 = 1054270^2 + 22711^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1112001022421 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1112001022421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112001022471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556000511210 + 556000511211.
It is an arithmetic number, because the mean of its divisors is an integer number (556000511211).
Almost surely, 21112001022421 is an apocalyptic number.
It is an amenable number.
1112001022421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112001022421 is an equidigital number, since it uses as much as digits as its factorization.
1112001022421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1112001022421 its reverse (1242201002111), we get a palindrome (2354202024532).
The spelling of 1112001022421 in words is "one trillion, one hundred twelve billion, one million, twenty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •