Base | Representation |
---|---|
bin | 101111000010111101… |
… | …0110011000100001011 |
3 | 100122210000201010221221 |
4 | 1132011322303010023 |
5 | 3123402420443201 |
6 | 114225113342511 |
7 | 10204433410636 |
oct | 1360572630413 |
9 | 318700633857 |
10 | 101031031051 |
11 | 39935423a85 |
12 | 176b7107a37 |
13 | 96b12c2ca2 |
14 | 4c65d68c1d |
15 | 29649ea4a1 |
hex | 1785eb310b |
101031031051 has 2 divisors, whose sum is σ = 101031031052. Its totient is φ = 101031031050.
The previous prime is 101031031021. The next prime is 101031031067. The reversal of 101031031051 is 150130130101.
It is an a-pointer prime, because the next prime (101031031067) can be obtained adding 101031031051 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101031031051 - 25 = 101031031019 is a prime.
It is not a weakly prime, because it can be changed into another prime (101031031021) 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 as a sum of consecutive naturals, namely, 50515515525 + 50515515526.
It is an arithmetic number, because the mean of its divisors is an integer number (50515515526).
Almost surely, 2101031031051 is an apocalyptic number.
101031031051 is a deficient number, since it is larger than the sum of its proper divisors (1).
101031031051 is an equidigital number, since it uses as much as digits as its factorization.
101031031051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 16.
Adding to 101031031051 its reverse (150130130101), we get a palindrome (251161161152).
The spelling of 101031031051 in words is "one hundred one billion, thirty-one million, thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •