Base | Representation |
---|---|
bin | 110000001110111011100111… |
… | …100000111000010111111101 |
3 | 1000211002122121001002000210122 |
4 | 300032323213200320113331 |
5 | 210301033442114441403 |
6 | 2031100124132544325 |
7 | 62453024421430043 |
oct | 6016734740702775 |
9 | 1024078531060718 |
10 | 212132318905853 |
11 | 616568a18205a5 |
12 | 1b9607b84820a5 |
13 | 9149cb80b7818 |
14 | 3a5538aa5c393 |
15 | 197d0ad6cb838 |
hex | c0eee78385fd |
212132318905853 has 2 divisors, whose sum is σ = 212132318905854. Its totient is φ = 212132318905852.
The previous prime is 212132318905847. The next prime is 212132318905861. The reversal of 212132318905853 is 358509813231212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 190785211500004 + 21347107405849 = 13812502^2 + 4620293^2 .
It is a cyclic number.
It is not a de Polignac number, because 212132318905853 - 220 = 212132317857277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212132318905795 and 212132318905804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212132318905813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106066159452926 + 106066159452927.
It is an arithmetic number, because the mean of its divisors is an integer number (106066159452927).
Almost surely, 2212132318905853 is an apocalyptic number.
It is an amenable number.
212132318905853 is a deficient number, since it is larger than the sum of its proper divisors (1).
212132318905853 is an equidigital number, since it uses as much as digits as its factorization.
212132318905853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3110400, while the sum is 53.
The spelling of 212132318905853 in words is "two hundred twelve trillion, one hundred thirty-two billion, three hundred eighteen million, nine hundred five thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •