Base | Representation |
---|---|
bin | 110000001101001010101010… |
… | …010101000110001101101111 |
3 | 1000210200001112102212000021102 |
4 | 300031022222111012031233 |
5 | 210242042044012303401 |
6 | 2030524305113553315 |
7 | 62441202022116554 |
oct | 6015125225061557 |
9 | 1023601472760242 |
10 | 212011033322351 |
11 | 6160a41321557a |
12 | 1b9411aa11583b |
13 | 913b729772373 |
14 | 3a4d562aa8a2b |
15 | 1979d6093256b |
hex | c0d2aa54636f |
212011033322351 has 2 divisors, whose sum is σ = 212011033322352. Its totient is φ = 212011033322350.
The previous prime is 212011033322321. The next prime is 212011033322371. The reversal of 212011033322351 is 153223330110212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212011033322351 - 26 = 212011033322287 is a prime.
It is a super-2 number, since 2×2120110333223512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212011033322311) 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, 106005516661175 + 106005516661176.
It is an arithmetic number, because the mean of its divisors is an integer number (106005516661176).
Almost surely, 2212011033322351 is an apocalyptic number.
212011033322351 is a deficient number, since it is larger than the sum of its proper divisors (1).
212011033322351 is an equidigital number, since it uses as much as digits as its factorization.
212011033322351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 212011033322351 its reverse (153223330110212), we get a palindrome (365234363432563).
The spelling of 212011033322351 in words is "two hundred twelve trillion, eleven billion, thirty-three million, three hundred twenty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •