Base | Representation |
---|---|
bin | 111111010110000… |
… | …1000111011000101 |
3 | 12111010111120222222 |
4 | 1332230020323011 |
5 | 13323112000401 |
6 | 550524502125 |
7 | 103446311204 |
oct | 17654107305 |
9 | 5433446888 |
10 | 2125500101 |
11 | 9a087575a |
12 | 4b39aa945 |
13 | 27b47888a |
14 | 16240723b |
15 | c6902c1b |
hex | 7eb08ec5 |
2125500101 has 2 divisors, whose sum is σ = 2125500102. Its totient is φ = 2125500100.
The previous prime is 2125500079. The next prime is 2125500121. The reversal of 2125500101 is 1010055212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1072562500 + 1052937601 = 32750^2 + 32449^2 .
It is a cyclic number.
It is not a de Polignac number, because 2125500101 - 230 = 1051758277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2125500101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2125500121) 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, 1062750050 + 1062750051.
It is an arithmetic number, because the mean of its divisors is an integer number (1062750051).
Almost surely, 22125500101 is an apocalyptic number.
It is an amenable number.
2125500101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2125500101 is an equidigital number, since it uses as much as digits as its factorization.
2125500101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 2125500101 is about 46103.1463243020. The cubic root of 2125500101 is about 1285.7416423591.
Adding to 2125500101 its reverse (1010055212), we get a palindrome (3135555313).
The spelling of 2125500101 in words is "two billion, one hundred twenty-five million, five hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •