Base | Representation |
---|---|
bin | 1001101011111010011000… |
… | …10000001001011000101110 |
3 | 2210102021002011102212121100 |
4 | 10311331030100021120232 |
5 | 10242434421130401110 |
6 | 113145032311543530 |
7 | 4325606255521101 |
oct | 465751420113056 |
9 | 83367064385540 |
10 | 21300022122030 |
11 | 687231a2198a3 |
12 | 248010638aba6 |
13 | bb6777b55422 |
14 | 538cd8724738 |
15 | 26e0e0bcabc0 |
hex | 135f4c40962e |
21300022122030 has 48 divisors (see below), whose sum is σ = 55385022944160. Its totient is φ = 5679496624704.
The previous prime is 21300022122011. The next prime is 21300022122083. The reversal of 21300022122030 is 3022122000312.
It is a super-2 number, since 2×213000221220302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21300022121994 and 21300022122012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9599997 + ... + 11608616.
It is an arithmetic number, because the mean of its divisors is an integer number (1153854644670).
Almost surely, 221300022122030 is an apocalyptic number.
21300022122030 is an abundant number, since it is smaller than the sum of its proper divisors (34085000822130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21300022122030 is a wasteful number, since it uses less digits than its factorization.
21300022122030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21219785 (or 21219782 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 21300022122030 its reverse (3022122000312), we get a palindrome (24322144122342).
The spelling of 21300022122030 in words is "twenty-one trillion, three hundred billion, twenty-two million, one hundred twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •