Base | Representation |
---|---|
bin | 111111010010010… |
… | …0001110101101001 |
3 | 12110222202020020101 |
4 | 1332210201311221 |
5 | 13322104130001 |
6 | 550414025401 |
7 | 103423331452 |
oct | 17644416551 |
9 | 5428666211 |
10 | 2123505001 |
11 | 99a732812 |
12 | 4b31a8261 |
13 | 27ac2a747 |
14 | 162048129 |
15 | c665ba01 |
hex | 7e921d69 |
2123505001 has 2 divisors, whose sum is σ = 2123505002. Its totient is φ = 2123505000.
The previous prime is 2123504983. The next prime is 2123505011. The reversal of 2123505001 is 1005053212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1246160601 + 877344400 = 35301^2 + 29620^2 .
It is a cyclic number.
It is not a de Polignac number, because 2123505001 - 215 = 2123472233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2123505001.
It is not a weakly prime, because it can be changed into another prime (2123505011) 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, 1061752500 + 1061752501.
It is an arithmetic number, because the mean of its divisors is an integer number (1061752501).
Almost surely, 22123505001 is an apocalyptic number.
It is an amenable number.
2123505001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2123505001 is an equidigital number, since it uses as much as digits as its factorization.
2123505001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 2123505001 is about 46081.5038925598. The cubic root of 2123505001 is about 1285.3392294288.
Adding to 2123505001 its reverse (1005053212), we get a palindrome (3128558213).
The spelling of 2123505001 in words is "two billion, one hundred twenty-three million, five hundred five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •