Base | Representation |
---|---|
bin | 1001000111010111101011… |
… | …1011110011101101111101 |
3 | 1022111010002211100012000011 |
4 | 2101311322323303231331 |
5 | 2303201002111402003 |
6 | 33152051142303221 |
7 | 2053036661415553 |
oct | 221657273635575 |
9 | 38433084305004 |
10 | 10022221200253 |
11 | 3214444652729 |
12 | 115a459727b11 |
13 | 579125a78322 |
14 | 26911440dbd3 |
15 | 125a7abb746d |
hex | 91d7aef3b7d |
10022221200253 has 2 divisors, whose sum is σ = 10022221200254. Its totient is φ = 10022221200252.
The previous prime is 10022221200203. The next prime is 10022221200259. The reversal of 10022221200253 is 35200212222001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9122707425924 + 899513774329 = 3020382^2 + 948427^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022221200253 - 221 = 10022219103101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022221200259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011110600126 + 5011110600127.
It is an arithmetic number, because the mean of its divisors is an integer number (5011110600127).
Almost surely, 210022221200253 is an apocalyptic number.
It is an amenable number.
10022221200253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022221200253 is an equidigital number, since it uses as much as digits as its factorization.
10022221200253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 10022221200253 its reverse (35200212222001), we get a palindrome (45222433422254).
The spelling of 10022221200253 in words is "ten trillion, twenty-two billion, two hundred twenty-one million, two hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •