Base | Representation |
---|---|
bin | 10010011111001010… |
… | …11010000001111001 |
3 | 221121200220101100001 |
4 | 21033211122001321 |
5 | 130311313444401 |
6 | 4320510113001 |
7 | 500645205655 |
oct | 111745320171 |
9 | 27550811301 |
10 | 9925140601 |
11 | 4233535042 |
12 | 1b0baab761 |
13 | c22339b7c |
14 | 6a2237a65 |
15 | 3d1522601 |
hex | 24f95a079 |
9925140601 has 2 divisors, whose sum is σ = 9925140602. Its totient is φ = 9925140600.
The previous prime is 9925140593. The next prime is 9925140629. The reversal of 9925140601 is 1060415299.
9925140601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7129269225 + 2795871376 = 84435^2 + 52876^2 .
It is a cyclic number.
It is not a de Polignac number, because 9925140601 - 23 = 9925140593 is a prime.
It is not a weakly prime, because it can be changed into another prime (9925140671) 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, 4962570300 + 4962570301.
It is an arithmetic number, because the mean of its divisors is an integer number (4962570301).
Almost surely, 29925140601 is an apocalyptic number.
It is an amenable number.
9925140601 is a deficient number, since it is larger than the sum of its proper divisors (1).
9925140601 is an equidigital number, since it uses as much as digits as its factorization.
9925140601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 37.
The square root of 9925140601 is about 99624.9998795483. Note that the first 3 decimals coincide. The cubic root of 9925140601 is about 2149.0452296476.
The spelling of 9925140601 in words is "nine billion, nine hundred twenty-five million, one hundred forty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •