Base | Representation |
---|---|
bin | 101110101000001001… |
… | …0101000111000001000 |
3 | 100120110022201122020020 |
4 | 1131100102220320020 |
5 | 3120032103423422 |
6 | 113555533300440 |
7 | 10143230046510 |
oct | 1352022507010 |
9 | 316408648206 |
10 | 100131311112 |
11 | 39513573088 |
12 | 174a5934720 |
13 | 9599a96c21 |
14 | 4bbc682840 |
15 | 2910a2695c |
hex | 17504a8e08 |
100131311112 has 32 divisors (see below), whose sum is σ = 286089460800. Its totient is φ = 28608945984.
The previous prime is 100131311081. The next prime is 100131311123. The reversal of 100131311112 is 211113131001.
It is a junction number, because it is equal to n+sod(n) for n = 100131311091 and 100131311100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 298009687 + ... + 298010022.
It is an arithmetic number, because the mean of its divisors is an integer number (8940295650).
Almost surely, 2100131311112 is an apocalyptic number.
100131311112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100131311112 is an abundant number, since it is smaller than the sum of its proper divisors (185958149688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100131311112 is a wasteful number, since it uses less digits than its factorization.
100131311112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 596019725 (or 596019721 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 100131311112 its reverse (211113131001), we get a palindrome (311244442113).
It can be divided in two parts, 10013 and 1311112, that added together give a triangular number (1321125 = T1625).
The spelling of 100131311112 in words is "one hundred billion, one hundred thirty-one million, three hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •