Base | Representation |
---|---|
bin | 1000011001101010… |
… | …1111001111110101 |
3 | 12211011110210202012 |
4 | 2012122233033311 |
5 | 14104304444323 |
6 | 1011435454005 |
7 | 106612340312 |
oct | 20632571765 |
9 | 5734423665 |
10 | 2255156213 |
11 | a57a82272 |
12 | 52b2b7305 |
13 | 29c2a397b |
14 | 175717d09 |
15 | d2eb4678 |
hex | 866af3f5 |
2255156213 has 2 divisors, whose sum is σ = 2255156214. Its totient is φ = 2255156212.
The previous prime is 2255156161. The next prime is 2255156249. The reversal of 2255156213 is 3126515522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2037800164 + 217356049 = 45142^2 + 14743^2 .
It is a cyclic number.
It is not a de Polignac number, because 2255156213 - 212 = 2255152117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2255156213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2255156513) 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, 1127578106 + 1127578107.
It is an arithmetic number, because the mean of its divisors is an integer number (1127578107).
Almost surely, 22255156213 is an apocalyptic number.
It is an amenable number.
2255156213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2255156213 is an equidigital number, since it uses as much as digits as its factorization.
2255156213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18000, while the sum is 32.
The square root of 2255156213 is about 47488.4850569062. The cubic root of 2255156213 is about 1311.3709038848.
The spelling of 2255156213 in words is "two billion, two hundred fifty-five million, one hundred fifty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •