Base | Representation |
---|---|
bin | 10110110000111101001111… |
… | …110010010100111100100000 |
3 | 111010111111122000121120202202 |
4 | 112300331033302110330200 |
5 | 101110341431213330422 |
6 | 552535033333432332 |
7 | 30042345450446420 |
oct | 2660751762247440 |
9 | 433444560546682 |
10 | 100121321230112 |
11 | 299a123974a006 |
12 | b290223a9b6a8 |
13 | 43b3527c8c580 |
14 | 1aa1c7d804480 |
15 | b895ba75ab92 |
hex | 5b0f4fc94f20 |
100121321230112 has 192 divisors, whose sum is σ = 243393697096704. Its totient is φ = 39479275929600.
The previous prime is 100121321230097. The next prime is 100121321230171. The reversal of 100121321230112 is 211032123121001.
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, 1549521518 + ... + 1549586130.
It is an arithmetic number, because the mean of its divisors is an integer number (1267675505712).
Almost surely, 2100121321230112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100121321230112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121696848548352).
100121321230112 is an abundant number, since it is smaller than the sum of its proper divisors (143272375866592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100121321230112 is a wasteful number, since it uses less digits than its factorization.
100121321230112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66371 (or 66363 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 100121321230112 its reverse (211032123121001), we get a palindrome (311153444351113).
The spelling of 100121321230112 in words is "one hundred trillion, one hundred twenty-one billion, three hundred twenty-one million, two hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •