Base | Representation |
---|---|
bin | 10001110001010000011… |
… | …111000001000110001100 |
3 | 11022201221000122002222120 |
4 | 101301100133001012030 |
5 | 130001323440122200 |
6 | 2332550353212540 |
7 | 154136342261466 |
oct | 21612037010614 |
9 | 4281830562876 |
10 | 1221121020300 |
11 | 430968a88275 |
12 | 1787b2b61150 |
13 | 8b1c72c2c5c |
14 | 43161661136 |
15 | 21b6e0909a0 |
hex | 11c507c118c |
1221121020300 has 72 divisors (see below), whose sum is σ = 3544618921536. Its totient is φ = 324571556160.
The previous prime is 1221121020269. The next prime is 1221121020313. The reversal of 1221121020300 is 30201211221.
It is a super-2 number, since 2×12211210203002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1221121020300.
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, 6537222 + ... + 6721421.
Almost surely, 21221121020300 is an apocalyptic number.
1221121020300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1221121020300 is an abundant number, since it is smaller than the sum of its proper divisors (2323497901236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221121020300 is a wasteful number, since it uses less digits than its factorization.
1221121020300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13258967 (or 13258960 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1221121020300 its reverse (30201211221), we get a palindrome (1251322231521).
The spelling of 1221121020300 in words is "one trillion, two hundred twenty-one billion, one hundred twenty-one million, twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.623 sec. • engine limits •