Base | Representation |
---|---|
bin | 1100001110011000111… |
… | …0100101001011110011 |
3 | 202002002201120211221211 |
4 | 3003212032211023303 |
5 | 11420110334342321 |
6 | 240252103100551 |
7 | 21113342102023 |
oct | 3034616451363 |
9 | 662081524854 |
10 | 210021012211 |
11 | 81084427a7a |
12 | 34853741757 |
13 | 16a604856ba |
14 | a244d53a83 |
15 | 56e30d30e1 |
hex | 30e63a52f3 |
210021012211 has 8 divisors (see below), whose sum is σ = 219168255744. Its totient is φ = 200875093320.
The previous prime is 210021012169. The next prime is 210021012217. The reversal of 210021012211 is 112210120012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210021012211 - 29 = 210021011699 is a prime.
It is a super-3 number, since 3×2100210122113 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210021012191 and 210021012200.
It is not an unprimeable number, because it can be changed into a prime (210021012217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105 + ... + 648106.
It is an arithmetic number, because the mean of its divisors is an integer number (27396031968).
Almost surely, 2210021012211 is an apocalyptic number.
210021012211 is a deficient number, since it is larger than the sum of its proper divisors (9147243533).
210021012211 is a wasteful number, since it uses less digits than its factorization.
210021012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 662321.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210021012211 its reverse (112210120012), we get a palindrome (322231132223).
The spelling of 210021012211 in words is "two hundred ten billion, twenty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •