Base | Representation |
---|---|
bin | 10010110101011101… |
… | …01100000011111011 |
3 | 222002201202002010221 |
4 | 21122232230003323 |
5 | 131202200420011 |
6 | 4351225520511 |
7 | 505405425355 |
oct | 113256540373 |
9 | 28081662127 |
10 | 10112123131 |
11 | 431a036860 |
12 | 1b62643137 |
13 | c51cb7016 |
14 | 6bcdcc0d5 |
15 | 3e2b59971 |
hex | 25abac0fb |
10112123131 has 16 divisors (see below), whose sum is σ = 11157004800. Its totient is φ = 9088444000.
The previous prime is 10112123113. The next prime is 10112123173. The reversal of 10112123131 is 13132121101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10112123131 - 29 = 10112122619 is a prime.
It is a super-2 number, since 2×101121231312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112123731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 792480 + ... + 805138.
It is an arithmetic number, because the mean of its divisors is an integer number (697312800).
Almost surely, 210112123131 is an apocalyptic number.
10112123131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10112123131 is a deficient number, since it is larger than the sum of its proper divisors (1044881669).
10112123131 is a wasteful number, since it uses less digits than its factorization.
10112123131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13490.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10112123131 its reverse (13132121101), we get a palindrome (23244244232).
The spelling of 10112123131 in words is "ten billion, one hundred twelve million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •