Base | Representation |
---|---|
bin | 110001001100100111… |
… | …0110010010011011011 |
3 | 101002200221010100022222 |
4 | 1202121032302103123 |
5 | 3212332400131321 |
6 | 120311314134255 |
7 | 10430051140622 |
oct | 1423116622333 |
9 | 332627110288 |
10 | 105650005211 |
11 | 408957456a3 |
12 | 18585b8138b |
13 | 9c692247aa |
14 | 51835a46b9 |
15 | 2b3528a3ab |
hex | 18993b24db |
105650005211 has 2 divisors, whose sum is σ = 105650005212. Its totient is φ = 105650005210.
The previous prime is 105650005121. The next prime is 105650005243. The reversal of 105650005211 is 112500056501.
Together with previous prime (105650005121) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105650005211 - 226 = 105582896347 is a prime.
It is a super-2 number, since 2×1056500052112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105650001211) 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, 52825002605 + 52825002606.
It is an arithmetic number, because the mean of its divisors is an integer number (52825002606).
Almost surely, 2105650005211 is an apocalyptic number.
105650005211 is a deficient number, since it is larger than the sum of its proper divisors (1).
105650005211 is an equidigital number, since it uses as much as digits as its factorization.
105650005211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 26.
The spelling of 105650005211 in words is "one hundred five billion, six hundred fifty million, five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.348 sec. • engine limits •