Base | Representation |
---|---|
bin | 101111101111111001110000… |
… | …001000010111011110111001 |
3 | 1000112112210201220211202022202 |
4 | 233233321300020113132321 |
5 | 210011120011111242103 |
6 | 2022344401312155545 |
7 | 62143000032534062 |
oct | 5757716010273671 |
9 | 1015483656752282 |
10 | 210000012212153 |
11 | 60a04561228559 |
12 | 1b6774ab238bb5 |
13 | 9023bbab01b17 |
14 | 39c00aa611569 |
15 | 19428b00e5988 |
hex | befe702177b9 |
210000012212153 has 2 divisors, whose sum is σ = 210000012212154. Its totient is φ = 210000012212152.
The previous prime is 210000012212077. The next prime is 210000012212203. The reversal of 210000012212153 is 351212210000012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 198213369695929 + 11786642516224 = 14078827^2 + 3433168^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210000012212153 is a prime.
It is not a weakly prime, because it can be changed into another prime (210000012218153) 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, 105000006106076 + 105000006106077.
It is an arithmetic number, because the mean of its divisors is an integer number (105000006106077).
Almost surely, 2210000012212153 is an apocalyptic number.
It is an amenable number.
210000012212153 is a deficient number, since it is larger than the sum of its proper divisors (1).
210000012212153 is an equidigital number, since it uses as much as digits as its factorization.
210000012212153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 210000012212153 its reverse (351212210000012), we get a palindrome (561212222212165).
The spelling of 210000012212153 in words is "two hundred ten trillion, twelve million, two hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •