Base | Representation |
---|---|
bin | 110001010010111100… |
… | …1011111110011111001 |
3 | 101010020202000122010121 |
4 | 1202211321133303321 |
5 | 3213301301400444 |
6 | 120344345213241 |
7 | 10435241433412 |
oct | 1424571376371 |
9 | 333222018117 |
10 | 105862528249 |
11 | 40994701375 |
12 | 18625191221 |
13 | 9ca1274b7a |
14 | 51a38c6809 |
15 | 2b48c6a084 |
hex | 18a5e5fcf9 |
105862528249 has 2 divisors, whose sum is σ = 105862528250. Its totient is φ = 105862528248.
The previous prime is 105862528217. The next prime is 105862528267. The reversal of 105862528249 is 942825268501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72339481600 + 33523046649 = 268960^2 + 183093^2 .
It is a cyclic number.
It is not a de Polignac number, because 105862528249 - 25 = 105862528217 is a prime.
It is a super-2 number, since 2×1058625282492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105862528196 and 105862528205.
It is not a weakly prime, because it can be changed into another prime (105862528949) 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, 52931264124 + 52931264125.
It is an arithmetic number, because the mean of its divisors is an integer number (52931264125).
Almost surely, 2105862528249 is an apocalyptic number.
It is an amenable number.
105862528249 is a deficient number, since it is larger than the sum of its proper divisors (1).
105862528249 is an equidigital number, since it uses as much as digits as its factorization.
105862528249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2764800, while the sum is 52.
The spelling of 105862528249 in words is "one hundred five billion, eight hundred sixty-two million, five hundred twenty-eight thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •