Base | Representation |
---|---|
bin | 1001010111100000… |
… | …0000000110001001 |
3 | 20111020110002211211 |
4 | 2111320000012021 |
5 | 20122202020031 |
6 | 1053302053121 |
7 | 116211526633 |
oct | 22570000611 |
9 | 6436402754 |
10 | 2514485641 |
11 | 10803a8308 |
12 | 5a211a1a1 |
13 | 310c31935 |
14 | 19bd41a53 |
15 | eab3cbb1 |
hex | 95e00189 |
2514485641 has 2 divisors, whose sum is σ = 2514485642. Its totient is φ = 2514485640.
The previous prime is 2514485599. The next prime is 2514485653. The reversal of 2514485641 is 1465844152.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2480438416 + 34047225 = 49804^2 + 5835^2 .
It is a cyclic number.
It is not a de Polignac number, because 2514485641 - 211 = 2514483593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2514485594 and 2514485603.
It is not a weakly prime, because it can be changed into another prime (2514485041) 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, 1257242820 + 1257242821.
It is an arithmetic number, because the mean of its divisors is an integer number (1257242821).
Almost surely, 22514485641 is an apocalyptic number.
It is an amenable number.
2514485641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2514485641 is an equidigital number, since it uses as much as digits as its factorization.
2514485641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 153600, while the sum is 40.
The square root of 2514485641 is about 50144.6471819276. The cubic root of 2514485641 is about 1359.8251002376.
The spelling of 2514485641 in words is "two billion, five hundred fourteen million, four hundred eighty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •