Base | Representation |
---|---|
bin | 10001110001001011001… |
… | …011110100000010111110 |
3 | 11022201200211022111022020 |
4 | 101301023023310002332 |
5 | 130001133204200110 |
6 | 2332533455301010 |
7 | 154134212413641 |
oct | 21611313640276 |
9 | 4281624274266 |
10 | 1221032100030 |
11 | 430922874146 |
12 | 17878921a766 |
13 | 8b1b1a5b602 |
14 | 43153915a58 |
15 | 21b66378d70 |
hex | 11c4b2f40be |
1221032100030 has 64 divisors (see below), whose sum is σ = 3142914877440. Its totient is φ = 302651047296.
The previous prime is 1221032100023. The next prime is 1221032100031. The reversal of 1221032100030 is 300012301221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 1221032099982 and 1221032100009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221032100031) 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, 20178862 + ... + 20239281.
It is an arithmetic number, because the mean of its divisors is an integer number (49108044960).
Almost surely, 21221032100030 is an apocalyptic number.
1221032100030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1221032100030 is an abundant number, since it is smaller than the sum of its proper divisors (1921882777410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221032100030 is a wasteful number, since it uses less digits than its factorization.
1221032100030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40418225.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1221032100030 its reverse (300012301221), we get a palindrome (1521044401251).
The spelling of 1221032100030 in words is "one trillion, two hundred twenty-one billion, thirty-two million, one hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •