Base | Representation |
---|---|
bin | 1001001100100111010101… |
… | …1011010110111111101011 |
3 | 1022210201200012000000021211 |
4 | 2103021311123112333223 |
5 | 2311140014204334011 |
6 | 33301312003213551 |
7 | 2062406536204540 |
oct | 223116533267753 |
9 | 38721605000254 |
10 | 10112323121131 |
11 | 3249680857450 |
12 | 1173a046772b7 |
13 | 584784a344ca |
14 | 26d620a7cbc7 |
15 | 1280a0e77b21 |
hex | 932756d6feb |
10112323121131 has 32 divisors (see below), whose sum is σ = 12814820513280. Its totient is φ = 7750213228800.
The previous prime is 10112323121099. The next prime is 10112323121171. The reversal of 10112323121131 is 13112132321101.
It is not a de Polignac number, because 10112323121131 - 25 = 10112323121099 is a prime.
It is a super-2 number, since 2×101123231211312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112323121171) 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, 172721695 + ... + 172780231.
It is an arithmetic number, because the mean of its divisors is an integer number (400463141040).
Almost surely, 210112323121131 is an apocalyptic number.
10112323121131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10112323121131 is a deficient number, since it is larger than the sum of its proper divisors (2702497392149).
10112323121131 is a wasteful number, since it uses less digits than its factorization.
10112323121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95395.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 10112323121131 its reverse (13112132321101), we get a palindrome (23224455442232).
The spelling of 10112323121131 in words is "ten trillion, one hundred twelve billion, three hundred twenty-three million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •