Base | Representation |
---|---|
bin | 101111001001010111… |
… | …1011101100010111011 |
3 | 100200100000111222200202 |
4 | 1132102233131202323 |
5 | 3124323004210011 |
6 | 114302320352415 |
7 | 10212655121111 |
oct | 1362257354273 |
9 | 320300458622 |
10 | 101246163131 |
11 | 39a35901993 |
12 | 1775717570b |
13 | 9716a47a89 |
14 | 4c86769ab1 |
15 | 297884323b |
hex | 1792bdd8bb |
101246163131 has 2 divisors, whose sum is σ = 101246163132. Its totient is φ = 101246163130.
The previous prime is 101246163103. The next prime is 101246163191. The reversal of 101246163131 is 131361642101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101246163131 - 226 = 101179054267 is a prime.
It is a super-2 number, since 2×1012461631312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 101246163094 and 101246163103.
It is not a weakly prime, because it can be changed into another prime (101246163191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50623081565 + 50623081566.
It is an arithmetic number, because the mean of its divisors is an integer number (50623081566).
Almost surely, 2101246163131 is an apocalyptic number.
101246163131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101246163131 is an equidigital number, since it uses as much as digits as its factorization.
101246163131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 101246163131 in words is "one hundred one billion, two hundred forty-six million, one hundred sixty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •