Base | Representation |
---|---|
bin | 101111110000001110001111… |
… | …011011101101001100010011 |
3 | 1000112121220112010201112120102 |
4 | 233300032033123231030103 |
5 | 210012000040111240422 |
6 | 2022402440324403015 |
7 | 62144406151462223 |
oct | 5760161733551423 |
9 | 1015556463645512 |
10 | 210022012211987 |
11 | 60a129206a3aa8 |
12 | 1b67b80ab4646b |
13 | 9025cb59539c1 |
14 | 39c1196392083 |
15 | 194324b724192 |
hex | bf038f6ed313 |
210022012211987 has 2 divisors, whose sum is σ = 210022012211988. Its totient is φ = 210022012211986.
The previous prime is 210022012211981. The next prime is 210022012212043. The reversal of 210022012211987 is 789112210220012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210022012211987 - 222 = 210022008017683 is a prime.
It is a super-2 number, since 2×2100220122119872 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210022012211987.
It is not a weakly prime, because it can be changed into another prime (210022012211981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105011006105993 + 105011006105994.
It is an arithmetic number, because the mean of its divisors is an integer number (105011006105994).
Almost surely, 2210022012211987 is an apocalyptic number.
210022012211987 is a deficient number, since it is larger than the sum of its proper divisors (1).
210022012211987 is an equidigital number, since it uses as much as digits as its factorization.
210022012211987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 38.
Adding to 210022012211987 its reverse (789112210220012), we get a palindrome (999134222431999).
The spelling of 210022012211987 in words is "two hundred ten trillion, twenty-two billion, twelve million, two hundred eleven thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •