Base | Representation |
---|---|
bin | 1001100110101011010001… |
… | …10001100100101000100001 |
3 | 2202210001200220211202012011 |
4 | 10303111220301210220201 |
5 | 10232012442134120001 |
6 | 112530240122032521 |
7 | 4306610031060151 |
oct | 463255061445041 |
9 | 82701626752164 |
10 | 21120112020001 |
11 | 6802a976a9365 |
12 | 2451276948741 |
13 | ba2805a28557 |
14 | 53030c84a761 |
15 | 2695b132dd51 |
hex | 133568c64a21 |
21120112020001 has 8 divisors (see below), whose sum is σ = 21478891707360. Its totient is φ = 20761359388992.
The previous prime is 21120112019987. The next prime is 21120112020053. The reversal of 21120112020001 is 10002021102112.
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 21120112020001 - 219 = 21120111495713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120116020001) 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, 5186535 + ... + 8315068.
It is an arithmetic number, because the mean of its divisors is an integer number (2684861463420).
Almost surely, 221120112020001 is an apocalyptic number.
It is an amenable number.
21120112020001 is a deficient number, since it is larger than the sum of its proper divisors (358779687359).
21120112020001 is a wasteful number, since it uses less digits than its factorization.
21120112020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13528175.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21120112020001 its reverse (10002021102112), we get a palindrome (31122133122113).
The spelling of 21120112020001 in words is "twenty-one trillion, one hundred twenty billion, one hundred twelve million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •