Base | Representation |
---|---|
bin | 100110100101000111111… |
… | …011010110001110011001 |
3 | 100101110012210110201120211 |
4 | 212211013323112032121 |
5 | 321414130044431442 |
6 | 5345540054251121 |
7 | 362354150306416 |
oct | 46450773261631 |
9 | 10343183421524 |
10 | 2651201561497 |
11 | 93240618a365 |
12 | 3699a2056aa1 |
13 | 163012b81718 |
14 | 92466c7d10d |
15 | 48e6ce38617 |
hex | 26947ed6399 |
2651201561497 has 2 divisors, whose sum is σ = 2651201561498. Its totient is φ = 2651201561496.
The previous prime is 2651201561401. The next prime is 2651201561539. The reversal of 2651201561497 is 7941651021562.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1987581153856 + 663620407641 = 1409816^2 + 814629^2 .
It is a cyclic number.
It is not a de Polignac number, because 2651201561497 - 223 = 2651193172889 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2651201561497.
It is not a weakly prime, because it can be changed into another prime (2651201562497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1325600780748 + 1325600780749.
It is an arithmetic number, because the mean of its divisors is an integer number (1325600780749).
Almost surely, 22651201561497 is an apocalyptic number.
It is an amenable number.
2651201561497 is a deficient number, since it is larger than the sum of its proper divisors (1).
2651201561497 is an equidigital number, since it uses as much as digits as its factorization.
2651201561497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 49.
The spelling of 2651201561497 in words is "two trillion, six hundred fifty-one billion, two hundred one million, five hundred sixty-one thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •