Base | Representation |
---|---|
bin | 10110101111100001110010… |
… | …000001010000110111111011 |
3 | 111010011010010121100101111111 |
4 | 112233201302001100313323 |
5 | 101102234312444320011 |
6 | 552421552154341151 |
7 | 30032300641144123 |
oct | 2657416201206773 |
9 | 433133117311444 |
10 | 100023111323131 |
11 | 29963621821327 |
12 | b27519572a7b7 |
13 | 43a71a62b1789 |
14 | 1a9b2043dbc83 |
15 | b86c6d76e121 |
hex | 5af872050dfb |
100023111323131 has 4 divisors (see below), whose sum is σ = 100165797645264. Its totient is φ = 99880425001000.
The previous prime is 100023111323071. The next prime is 100023111323137. The reversal of 100023111323131 is 131323111320001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100023111323131 - 243 = 91227018300923 is a prime.
It is a super-2 number, since 2×1000231113231312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100023111323137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71343160015 + ... + 71343161416.
It is an arithmetic number, because the mean of its divisors is an integer number (25041449411316).
Almost surely, 2100023111323131 is an apocalyptic number.
100023111323131 is a deficient number, since it is larger than the sum of its proper divisors (142686322133).
100023111323131 is an equidigital number, since it uses as much as digits as its factorization.
100023111323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142686322132.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 100023111323131 its reverse (131323111320001), we get a palindrome (231346222643132).
The spelling of 100023111323131 in words is "one hundred trillion, twenty-three billion, one hundred eleven million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •