Base | Representation |
---|---|
bin | 100101010011110… |
… | …011010111011001 |
3 | 1121121211110101202 |
4 | 211103303113121 |
5 | 2240220314441 |
6 | 142040123545 |
7 | 21340320431 |
oct | 4523632731 |
9 | 1547743352 |
10 | 625948121 |
11 | 2a13710a7 |
12 | 1557665b5 |
13 | 9c8b2506 |
14 | 5d1bd2c1 |
15 | 39e4619b |
hex | 254f35d9 |
625948121 has 2 divisors, whose sum is σ = 625948122. Its totient is φ = 625948120.
The previous prime is 625948117. The next prime is 625948159. The reversal of 625948121 is 121849526.
It is an a-pointer prime, because the next prime (625948159) can be obtained adding 625948121 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 592435600 + 33512521 = 24340^2 + 5789^2 .
It is a cyclic number.
It is not a de Polignac number, because 625948121 - 22 = 625948117 is a prime.
It is a super-2 number, since 2×6259481212 = 783622100366861282, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (625248121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 312974060 + 312974061.
It is an arithmetic number, because the mean of its divisors is an integer number (312974061).
Almost surely, 2625948121 is an apocalyptic number.
It is an amenable number.
625948121 is a deficient number, since it is larger than the sum of its proper divisors (1).
625948121 is an equidigital number, since it uses as much as digits as its factorization.
625948121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 38.
The square root of 625948121 is about 25018.9552339821. The cubic root of 625948121 is about 855.4200919994.
The spelling of 625948121 in words is "six hundred twenty-five million, nine hundred forty-eight thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •