Base | Representation |
---|---|
bin | 1001000111010011111111… |
… | …1111001001101101101101 |
3 | 1022111000112220101211120022 |
4 | 2101310333333021231231 |
5 | 2303141440422033122 |
6 | 33151405053131525 |
7 | 2053003322265332 |
oct | 221647777115555 |
9 | 38430486354508 |
10 | 10021232221037 |
11 | 3213a87376a34 |
12 | 115a222489ba5 |
13 | 578cc8bc951b |
14 | 26905cd30989 |
15 | 125a1de61642 |
hex | 91d3ffc9b6d |
10021232221037 has 2 divisors, whose sum is σ = 10021232221038. Its totient is φ = 10021232221036.
The previous prime is 10021232221009. The next prime is 10021232221051. The reversal of 10021232221037 is 73012223212001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9918506201956 + 102726019081 = 3149366^2 + 320509^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021232221037 - 238 = 9746354314093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10021232220997 and 10021232221015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10021232221837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010616110518 + 5010616110519.
It is an arithmetic number, because the mean of its divisors is an integer number (5010616110519).
Almost surely, 210021232221037 is an apocalyptic number.
It is an amenable number.
10021232221037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021232221037 is an equidigital number, since it uses as much as digits as its factorization.
10021232221037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 10021232221037 its reverse (73012223212001), we get a palindrome (83033455433038).
The spelling of 10021232221037 in words is "ten trillion, twenty-one billion, two hundred thirty-two million, two hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •