Base | Representation |
---|---|
bin | 10110110011100101101110… |
… | …111011010111110100100000 |
3 | 111011010210121000202020011221 |
4 | 112303211232323113310200 |
5 | 101121322432433240222 |
6 | 553154113122144424 |
7 | 30061411551401200 |
oct | 2663455673276440 |
9 | 434123530666157 |
10 | 100302232321312 |
11 | 29a60a352a951a |
12 | b2bb2b27b2114 |
13 | 43c75c95b1928 |
14 | 1aaa922606400 |
15 | b8e157e320c7 |
hex | 5b396eed7d20 |
100302232321312 has 288 divisors, whose sum is σ = 236209553661312. Its totient is φ = 41780580581376.
The previous prime is 100302232321307. The next prime is 100302232321339. The reversal of 100302232321312 is 213123232203001.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21192102498 + ... + 21192107230.
It is an arithmetic number, because the mean of its divisors is an integer number (820172061324).
Almost surely, 2100302232321312 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 100302232321312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118104776830656).
100302232321312 is an abundant number, since it is smaller than the sum of its proper divisors (135907321340000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100302232321312 is a wasteful number, since it uses less digits than its factorization.
100302232321312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6280 (or 6265 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 100302232321312 its reverse (213123232203001), we get a palindrome (313425464524313).
The spelling of 100302232321312 in words is "one hundred trillion, three hundred two billion, two hundred thirty-two million, three hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •