Base | Representation |
---|---|
bin | 110001001001111111… |
… | …1011101000110010001 |
3 | 101002110210201022012121 |
4 | 1202103333131012101 |
5 | 3212142344200423 |
6 | 120254454054241 |
7 | 10424633021551 |
oct | 1422377350621 |
9 | 332423638177 |
10 | 105562100113 |
11 | 40850065258 |
12 | 1856064a381 |
13 | 9c53c57242 |
14 | 5175a41161 |
15 | 2b2c6c445d |
hex | 1893fdd191 |
105562100113 has 2 divisors, whose sum is σ = 105562100114. Its totient is φ = 105562100112.
The previous prime is 105562100087. The next prime is 105562100131. The reversal of 105562100113 is 311001265501.
It is a happy number.
Together with next prime (105562100131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80308758544 + 25253341569 = 283388^2 + 158913^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105562100113 is a prime.
It is a super-2 number, since 2×1055621001132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105562100143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52781050056 + 52781050057.
It is an arithmetic number, because the mean of its divisors is an integer number (52781050057).
Almost surely, 2105562100113 is an apocalyptic number.
It is an amenable number.
105562100113 is a deficient number, since it is larger than the sum of its proper divisors (1).
105562100113 is an equidigital number, since it uses as much as digits as its factorization.
105562100113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 105562100113 its reverse (311001265501), we get a palindrome (416563365614).
The spelling of 105562100113 in words is "one hundred five billion, five hundred sixty-two million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •