Base | Representation |
---|---|
bin | 10110110001000110100010… |
… | …100101011111110100110011 |
3 | 111010112110101111000101100010 |
4 | 112301012202211133310303 |
5 | 101111022400334412243 |
6 | 552543403452030003 |
7 | 30043150652311632 |
oct | 2661064245376463 |
9 | 433473344011303 |
10 | 100131300310323 |
11 | 299a549a675737 |
12 | b292149a62303 |
13 | 43b4458533a69 |
14 | 1aa2548c7d519 |
15 | b899a1885433 |
hex | 5b11a295fd33 |
100131300310323 has 16 divisors (see below), whose sum is σ = 139314680144640. Its totient is φ = 63851125619424.
The previous prime is 100131300310289. The next prime is 100131300310337. The reversal of 100131300310323 is 323013003131001.
It is not a de Polignac number, because 100131300310323 - 26 = 100131300310259 is a prime.
It is a super-2 number, since 2×1001313003103232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100131300310323.
It is not an unprimeable number, because it can be changed into a prime (100131300310423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1945533 + ... + 14284526.
It is an arithmetic number, because the mean of its divisors is an integer number (8707167509040).
Almost surely, 2100131300310323 is an apocalyptic number.
100131300310323 is a deficient number, since it is larger than the sum of its proper divisors (39183379834317).
100131300310323 is a wasteful number, since it uses less digits than its factorization.
100131300310323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16319498.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 100131300310323 its reverse (323013003131001), we get a palindrome (423144303441324).
The spelling of 100131300310323 in words is "one hundred trillion, one hundred thirty-one billion, three hundred million, three hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •