Base | Representation |
---|---|
bin | 1001000110010111111100… |
… | …01011111101010000111001 |
3 | 2121211221212210100200112212 |
4 | 10203023332023331100321 |
5 | 10110321413341242103 |
6 | 110320322535344505 |
7 | 4133455650262445 |
oct | 443137613752071 |
9 | 77757783320485 |
10 | 20010222212153 |
11 | 6415318856358 |
12 | 22b2146b22135 |
13 | b21c57034794 |
14 | 4d26ddb05825 |
15 | 24a7a24d97d8 |
hex | 1232fe2fd439 |
20010222212153 has 2 divisors, whose sum is σ = 20010222212154. Its totient is φ = 20010222212152.
The previous prime is 20010222212111. The next prime is 20010222212209. The reversal of 20010222212153 is 35121222201002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17181663335929 + 2828558876224 = 4145077^2 + 1681832^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010222212153 - 28 = 20010222211897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20010222212753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005111106076 + 10005111106077.
It is an arithmetic number, because the mean of its divisors is an integer number (10005111106077).
Almost surely, 220010222212153 is an apocalyptic number.
It is an amenable number.
20010222212153 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010222212153 is an equidigital number, since it uses as much as digits as its factorization.
20010222212153 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 23.
Adding to 20010222212153 its reverse (35121222201002), we get a palindrome (55131444413155).
The spelling of 20010222212153 in words is "twenty trillion, ten billion, two hundred twenty-two million, two hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •