Base | Representation |
---|---|
bin | 10110101111100001110011… |
… | …001100011000000010111111 |
3 | 111010011010011222101202100102 |
4 | 112233201303030120002333 |
5 | 101102234333014411221 |
6 | 552421554140351315 |
7 | 30032301300412652 |
oct | 2657416314300277 |
9 | 433133158352312 |
10 | 100023131013311 |
11 | 2996363194a900 |
12 | b2751a024553b |
13 | 43a71aa3b6b7c |
14 | 1a9b206c85899 |
15 | b86c7035d30b |
hex | 5af8733180bf |
100023131013311 has 12 divisors (see below), whose sum is σ = 110089175650272. Its totient is φ = 90809040300000.
The previous prime is 100023131013233. The next prime is 100023131013331. The reversal of 100023131013311 is 113310131320001.
It is not a de Polignac number, because 100023131013311 - 226 = 100023063904447 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100023131013331) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 550266950 + ... + 550448691.
It is an arithmetic number, because the mean of its divisors is an integer number (9174097970856).
Almost surely, 2100023131013311 is an apocalyptic number.
100023131013311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100023131013311 is a deficient number, since it is larger than the sum of its proper divisors (10066044636961).
100023131013311 is a wasteful number, since it uses less digits than its factorization.
100023131013311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100716414 (or 1100716403 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 100023131013311 its reverse (113310131320001), we get a palindrome (213333262333312).
The spelling of 100023131013311 in words is "one hundred trillion, twenty-three billion, one hundred thirty-one million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •