Base | Representation |
---|---|
bin | 1001101001010100110001… |
… | …01011010100110101010000 |
3 | 2210002202120201121012020202 |
4 | 10310222120223110311100 |
5 | 10240010323130031000 |
6 | 113040125512354332 |
7 | 4316311036131212 |
oct | 464523053246520 |
9 | 83082521535222 |
10 | 21211110002000 |
11 | 6838643695066 |
12 | 2466a319a59a8 |
13 | bab27852c309 |
14 | 5348a20cc5b2 |
15 | 26bb3a0dddd5 |
hex | 134a98ad4d50 |
21211110002000 has 80 divisors (see below), whose sum is σ = 53518397317632. Its totient is φ = 8115555113600.
The previous prime is 21211110001981. The next prime is 21211110002009. The reversal of 21211110002000 is 20001111212.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×212111100020002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211110002009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 230509544 + ... + 230601543.
Almost surely, 221211110002000 is an apocalyptic number.
21211110002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21211110002000 is an abundant number, since it is smaller than the sum of its proper divisors (32307287315632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21211110002000 is a wasteful number, since it uses less digits than its factorization.
21211110002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 461111133 (or 461111117 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21211110002000 its reverse (20001111212), we get a palindrome (21231111113212).
The spelling of 21211110002000 in words is "twenty-one trillion, two hundred eleven billion, one hundred ten million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •