Base | Representation |
---|---|
bin | 1001001101001000000111… |
… | …0000110111110111110000 |
3 | 1022211120101020220212200010 |
4 | 2103102001300313313300 |
5 | 2311311023211201000 |
6 | 33305324531254520 |
7 | 2063140534503051 |
oct | 223220160676760 |
9 | 38746336825603 |
10 | 10121120022000 |
11 | 3252385439259 |
12 | 117565a74a440 |
13 | 5855573b39b0 |
14 | 26dc17106728 |
15 | 1284183d6d50 |
hex | 93481c37df0 |
10121120022000 has 160 divisors (see below), whose sum is σ = 35140528987200. Its totient is φ = 2491352601600.
The previous prime is 10121120021993. The next prime is 10121120022077. The reversal of 10121120022000 is 22002112101.
It is a super-3 number, since 3×101211200220003 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64800975 + ... + 64956974.
It is an arithmetic number, because the mean of its divisors is an integer number (219628306170).
Almost surely, 210121120022000 is an apocalyptic number.
10121120022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10121120022000 is an abundant number, since it is smaller than the sum of its proper divisors (25019408965200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121120022000 is a wasteful number, since it uses less digits than its factorization.
10121120022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129757988 (or 129757972 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10121120022000 its reverse (22002112101), we get a palindrome (10143122134101).
The spelling of 10121120022000 in words is "ten trillion, one hundred twenty-one billion, one hundred twenty million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •