Base | Representation |
---|---|
bin | 1001100110101101010011… |
… | …01000010001101001110010 |
3 | 2202210011111202021001002112 |
4 | 10303112221220101221302 |
5 | 10232022204211231002 |
6 | 112530540111245322 |
7 | 4306646012444660 |
oct | 463265150215162 |
9 | 82704452231075 |
10 | 21121200102002 |
11 | 68034a5913490 |
12 | 245151b219842 |
13 | ba294a295660 |
14 | 5303b3165c30 |
15 | 269626b0d852 |
hex | 1335a9a11a72 |
21121200102002 has 64 divisors (see below), whose sum is σ = 42630076355328. Its totient is φ = 7579558368000.
The previous prime is 21121200102001. The next prime is 21121200102029. The reversal of 21121200102002 is 20020100212112.
It is a super-2 number, since 2×211212001020022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (21121200102001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10519649 + ... + 12365492.
It is an arithmetic number, because the mean of its divisors is an integer number (666094943052).
Almost surely, 221121200102002 is an apocalyptic number.
21121200102002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21121200102002 is an abundant number, since it is smaller than the sum of its proper divisors (21508876253326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21121200102002 is a wasteful number, since it uses less digits than its factorization.
21121200102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22885635.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21121200102002 its reverse (20020100212112), we get a palindrome (41141300314114).
The spelling of 21121200102002 in words is "twenty-one trillion, one hundred twenty-one billion, two hundred million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •