Base | Representation |
---|---|
bin | 101111001000010011… |
… | …0000000101010101001 |
3 | 100200020111201101001120 |
4 | 1132100212000222221 |
5 | 3124234243143423 |
6 | 114254552205453 |
7 | 10212036630360 |
oct | 1362046005251 |
9 | 320214641046 |
10 | 101210131113 |
11 | 39a17531563 |
12 | 17747099889 |
13 | 970c440360 |
14 | 4c81a6a7d7 |
15 | 29755c6ee3 |
hex | 1790980aa9 |
101210131113 has 32 divisors (see below), whose sum is σ = 170577313536. Its totient is φ = 51942705408.
The previous prime is 101210131093. The next prime is 101210131153. The reversal of 101210131113 is 311131012101.
It is not a de Polignac number, because 101210131113 - 25 = 101210131081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101210131092 and 101210131101.
It is not an unprimeable number, because it can be changed into a prime (101210131153) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4999806 + ... + 5020007.
It is an arithmetic number, because the mean of its divisors is an integer number (5330541048).
Almost surely, 2101210131113 is an apocalyptic number.
101210131113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101210131113 is a deficient number, since it is larger than the sum of its proper divisors (69367182423).
101210131113 is a wasteful number, since it uses less digits than its factorization.
101210131113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10019873.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 101210131113 its reverse (311131012101), we get a palindrome (412341143214).
It can be divided in two parts, 1012101 and 31113, that multiplied together give a palindrome (31489498413).
The spelling of 101210131113 in words is "one hundred one billion, two hundred ten million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •