Base | Representation |
---|---|
bin | 10011100011110101… |
… | …000100101011011011 |
3 | 2000012200100210221001 |
4 | 103203311010223123 |
5 | 321003031210021 |
6 | 13352010125431 |
7 | 1342311560656 |
oct | 234365045333 |
9 | 60180323831 |
10 | 21002210011 |
11 | 89a8222262 |
12 | 40a1720877 |
13 | 1c99209a03 |
14 | 103344a89d |
15 | 82dc37091 |
hex | 4e3d44adb |
21002210011 has 8 divisors (see below), whose sum is σ = 21445322544. Its totient is φ = 20563297920.
The previous prime is 21002210003. The next prime is 21002210017. The reversal of 21002210011 is 11001220012.
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 21002210011 - 23 = 21002210003 is a prime.
It is a super-2 number, since 2×210022100112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21002210011.
It is not an unprimeable number, because it can be changed into a prime (21002210017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1040005 + ... + 1060006.
It is an arithmetic number, because the mean of its divisors is an integer number (2680665318).
Almost surely, 221002210011 is an apocalyptic number.
21002210011 is a deficient number, since it is larger than the sum of its proper divisors (443112533).
21002210011 is a wasteful number, since it uses less digits than its factorization.
21002210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2100221.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21002210011 its reverse (11001220012), we get a palindrome (32003430023).
The spelling of 21002210011 in words is "twenty-one billion, two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •