Base | Representation |
---|---|
bin | 10010110100001001… |
… | …01001000110000011 |
3 | 222001222000002112022 |
4 | 21122010221012003 |
5 | 131141340212211 |
6 | 4350153352055 |
7 | 505212640565 |
oct | 113204510603 |
9 | 28058002468 |
10 | 10101100931 |
11 | 43138986a9 |
12 | 1b5aa0862b |
13 | c4c9280cc |
14 | 6bb75d335 |
15 | 3e1bcdbdb |
hex | 25a129183 |
10101100931 has 2 divisors, whose sum is σ = 10101100932. Its totient is φ = 10101100930.
The previous prime is 10101100883. The next prime is 10101100939. The reversal of 10101100931 is 13900110101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10101100931 is a prime.
It is a super-2 number, since 2×101011009312 (a number of 21 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 (10101100939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050550465 + 5050550466.
It is an arithmetic number, because the mean of its divisors is an integer number (5050550466).
Almost surely, 210101100931 is an apocalyptic number.
10101100931 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101100931 is an equidigital number, since it uses as much as digits as its factorization.
10101100931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 10101100931 in words is "ten billion, one hundred one million, one hundred thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •