Base | Representation |
---|---|
bin | 1001100110101011011110… |
… | …10001010111111111011000 |
3 | 2202210001222111221112020121 |
4 | 10303111233101113333120 |
5 | 10232013203040120440 |
6 | 112530255014203024 |
7 | 4306612523415565 |
oct | 463255721277730 |
9 | 82701874845217 |
10 | 21120221020120 |
11 | 6803043187802 |
12 | 24512a7353474 |
13 | ba28224a0771 |
14 | 53031d10186c |
15 | 2695babb034a |
hex | 13356f457fd8 |
21120221020120 has 64 divisors (see below), whose sum is σ = 50326845324480. Its totient is φ = 7949399863296.
The previous prime is 21120221020027. The next prime is 21120221020139. The reversal of 21120221020120 is 2102012202112.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 21120221020094 and 21120221020103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 294829 + ... + 6505948.
It is an arithmetic number, because the mean of its divisors is an integer number (786356958195).
Almost surely, 221120221020120 is an apocalyptic number.
21120221020120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21120221020120 is an abundant number, since it is smaller than the sum of its proper divisors (29206624304360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21120221020120 is a wasteful number, since it uses less digits than its factorization.
21120221020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6805372 (or 6805368 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21120221020120 its reverse (2102012202112), we get a palindrome (23222233222232).
The spelling of 21120221020120 in words is "twenty-one trillion, one hundred twenty billion, two hundred twenty-one million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •