Base | Representation |
---|---|
bin | 101110100100100010… |
… | …0010011010010000011 |
3 | 100120010212200002111002 |
4 | 1131021010103102003 |
5 | 3114310042042011 |
6 | 113535523442215 |
7 | 10140225632636 |
oct | 1351104232203 |
9 | 316125602432 |
10 | 100010112131 |
11 | 39461112536 |
12 | 1747122636b |
13 | 957a940357 |
14 | 4baa533c1d |
15 | 2905085c3b |
hex | 1749113483 |
100010112131 has 2 divisors, whose sum is σ = 100010112132. Its totient is φ = 100010112130.
The previous prime is 100010112113. The next prime is 100010112151. The reversal of 100010112131 is 131211010001.
It is a happy number.
Together with previous prime (100010112113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100010112131 - 222 = 100005917827 is a prime.
It is a super-2 number, since 2×1000101121312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (100010112151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005056065 + 50005056066.
It is an arithmetic number, because the mean of its divisors is an integer number (50005056066).
Almost surely, 2100010112131 is an apocalyptic number.
100010112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010112131 is an equidigital number, since it uses as much as digits as its factorization.
100010112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 100010112131 its reverse (131211010001), we get a palindrome (231221122132).
The spelling of 100010112131 in words is "one hundred billion, ten million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •