Base | Representation |
---|---|
bin | 10110110011100101101101… |
… | …110010001010110000101110 |
3 | 111011010210112200122021110010 |
4 | 112303211231302022300232 |
5 | 101121322413030200220 |
6 | 553154111154554050 |
7 | 30061411226314521 |
oct | 2663455562126056 |
9 | 434123480567403 |
10 | 100302213131310 |
11 | 29a60a25491813 |
12 | b2bb2a8298926 |
13 | 43c75c56230b8 |
14 | 1aaa91dc4cbb8 |
15 | b8e1563e11e0 |
hex | 5b396dc8ac2e |
100302213131310 has 32 divisors (see below), whose sum is σ = 241325624041632. Its totient is φ = 26680555443200.
The previous prime is 100302213131297. The next prime is 100302213131447. The reversal of 100302213131310 is 13131312203001.
It is a happy number.
It is a super-2 number, since 2×1003022131313102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4168824759 + ... + 4168848818.
It is an arithmetic number, because the mean of its divisors is an integer number (7541425751301).
Almost surely, 2100302213131310 is an apocalyptic number.
100302213131310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100302213131310 is an abundant number, since it is smaller than the sum of its proper divisors (141023410910322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100302213131310 is a wasteful number, since it uses less digits than its factorization.
100302213131310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8337673988.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 100302213131310 its reverse (13131312203001), we get a palindrome (113433525334311).
The spelling of 100302213131310 in words is "one hundred trillion, three hundred two billion, two hundred thirteen million, one hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •