Base | Representation |
---|---|
bin | 1001010010111111111111… |
… | …1000001101001001000001 |
3 | 1100012012211011020222211111 |
4 | 2110233333320031021001 |
5 | 2314434144122334103 |
6 | 33423533050443321 |
7 | 2103342121262251 |
oct | 224577770151101 |
9 | 40165734228744 |
10 | 10222020121153 |
11 | 3291152964155 |
12 | 1191119a33541 |
13 | 591c17522c89 |
14 | 274a6990b961 |
15 | 12ad7166c86d |
hex | 94bffe0d241 |
10222020121153 has 2 divisors, whose sum is σ = 10222020121154. Its totient is φ = 10222020121152.
The previous prime is 10222020121139. The next prime is 10222020121213. The reversal of 10222020121153 is 35112102022201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8580874651969 + 1641145469184 = 2929313^2 + 1281072^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222020121153 - 25 = 10222020121121 is a prime.
It is not a weakly prime, because it can be changed into another prime (10222020121123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111010060576 + 5111010060577.
It is an arithmetic number, because the mean of its divisors is an integer number (5111010060577).
Almost surely, 210222020121153 is an apocalyptic number.
It is an amenable number.
10222020121153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222020121153 is an equidigital number, since it uses as much as digits as its factorization.
10222020121153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 10222020121153 its reverse (35112102022201), we get a palindrome (45334122143354).
The spelling of 10222020121153 in words is "ten trillion, two hundred twenty-two billion, twenty million, one hundred twenty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •