Base | Representation |
---|---|
bin | 1001100110101011000101… |
… | …10100011101000010000001 |
3 | 2202210001102221211220011212 |
4 | 10303111202310131002001 |
5 | 10232012241100041001 |
6 | 112530222152415505 |
7 | 4306604405630165 |
oct | 463254264350201 |
9 | 82701387756155 |
10 | 21120012112001 |
11 | 6802a4626aa70 |
12 | 24512493a7595 |
13 | ba27bb1178aa |
14 | 5302dd480ca5 |
15 | 2695a76967bb |
hex | 133562d1d081 |
21120012112001 has 16 divisors (see below), whose sum is σ = 23117525922816. Its totient is φ = 19135435410000.
The previous prime is 21120012111977. The next prime is 21120012112009. The reversal of 21120012112001 is 10021121002112.
It is a cyclic number.
It is not a de Polignac number, because 21120012112001 - 226 = 21119945003137 is a prime.
It is a super-2 number, since 2×211200121120012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120012112009) 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 15 ways as a sum of consecutive naturals, for example, 22777466 + ... + 23686556.
It is an arithmetic number, because the mean of its divisors is an integer number (1444845370176).
Almost surely, 221120012112001 is an apocalyptic number.
It is an amenable number.
21120012112001 is a deficient number, since it is larger than the sum of its proper divisors (1997513810815).
21120012112001 is a wasteful number, since it uses less digits than its factorization.
21120012112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 916204.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21120012112001 its reverse (10021121002112), we get a palindrome (31141133114113).
The spelling of 21120012112001 in words is "twenty-one trillion, one hundred twenty billion, twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •