Base | Representation |
---|---|
bin | 101111110000001101011111… |
… | …101011101101001101001011 |
3 | 1000112121211110022021211111022 |
4 | 233300031133223231031023 |
5 | 210011441420020144404 |
6 | 2022402225030023055 |
7 | 62144350253234546 |
oct | 5760153753551513 |
9 | 1015554408254438 |
10 | 210021211099979 |
11 | 60a1254a473764 |
12 | 1b67b6267a7a8b |
13 | 9025bb89a1926 |
14 | 39c111bc1785d |
15 | 194320122c8be |
hex | bf035faed34b |
210021211099979 has 2 divisors, whose sum is σ = 210021211099980. Its totient is φ = 210021211099978.
The previous prime is 210021211099969. The next prime is 210021211100039. The reversal of 210021211099979 is 979990112120012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210021211099979 - 220 = 210021210051403 is a prime.
It is a super-2 number, since 2×2100212110999792 (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 210021211099979.
It is not a weakly prime, because it can be changed into another prime (210021211099969) 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, 105010605549989 + 105010605549990.
It is an arithmetic number, because the mean of its divisors is an integer number (105010605549990).
Almost surely, 2210021211099979 is an apocalyptic number.
210021211099979 is a deficient number, since it is larger than the sum of its proper divisors (1).
210021211099979 is an equidigital number, since it uses as much as digits as its factorization.
210021211099979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 367416, while the sum is 53.
The spelling of 210021211099979 in words is "two hundred ten trillion, twenty-one billion, two hundred eleven million, ninety-nine thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •