Base | Representation |
---|---|
bin | 1000011001111101… |
… | …0111110101110001 |
3 | 12211020202112012102 |
4 | 2012133113311301 |
5 | 14110112333212 |
6 | 1011521510145 |
7 | 106625560163 |
oct | 20637276561 |
9 | 5736675172 |
10 | 2256371057 |
11 | a58731a76 |
12 | 52b7a2355 |
13 | 29c60a905 |
14 | 175952933 |
15 | d31545c2 |
hex | 867d7d71 |
2256371057 has 2 divisors, whose sum is σ = 2256371058. Its totient is φ = 2256371056.
The previous prime is 2256371003. The next prime is 2256371059. The reversal of 2256371057 is 7501736522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1185838096 + 1070532961 = 34436^2 + 32719^2 .
It is a cyclic number.
It is not a de Polignac number, because 2256371057 - 28 = 2256370801 is a prime.
Together with 2256371059, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2256371057.
It is not a weakly prime, because it can be changed into another prime (2256371059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1128185528 + 1128185529.
It is an arithmetic number, because the mean of its divisors is an integer number (1128185529).
Almost surely, 22256371057 is an apocalyptic number.
It is an amenable number.
2256371057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2256371057 is an equidigital number, since it uses as much as digits as its factorization.
2256371057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88200, while the sum is 38.
The square root of 2256371057 is about 47501.2742671184. The cubic root of 2256371057 is about 1311.6063384389.
The spelling of 2256371057 in words is "two billion, two hundred fifty-six million, three hundred seventy-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •