Base | Representation |
---|---|
bin | 1100100001010… |
… | …00111010000101 |
3 | 21022121211102122 |
4 | 12100220322011 |
5 | 203341301112 |
6 | 14231015325 |
7 | 2413461536 |
oct | 620507205 |
9 | 238554378 |
10 | 105025157 |
11 | 54313a56 |
12 | 2b20a545 |
13 | 189b2b83 |
14 | dd3c68d |
15 | 9348872 |
hex | 6428e85 |
105025157 has 2 divisors, whose sum is σ = 105025158. Its totient is φ = 105025156.
The previous prime is 105025147. The next prime is 105025169. The reversal of 105025157 is 751520501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78872161 + 26152996 = 8881^2 + 5114^2 .
It is a cyclic number.
It is not a de Polignac number, because 105025157 - 26 = 105025093 is a prime.
It is a super-2 number, since 2×1050251572 = 22060567205749298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105025127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52512578 + 52512579.
It is an arithmetic number, because the mean of its divisors is an integer number (52512579).
Almost surely, 2105025157 is an apocalyptic number.
It is an amenable number.
105025157 is a deficient number, since it is larger than the sum of its proper divisors (1).
105025157 is an equidigital number, since it uses as much as digits as its factorization.
105025157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1750, while the sum is 26.
The square root of 105025157 is about 10248.1782283487. The cubic root of 105025157 is about 471.8070721746.
Adding to 105025157 its reverse (751520501), we get a palindrome (856545658).
The spelling of 105025157 in words is "one hundred five million, twenty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •