Base | Representation |
---|---|
bin | 1000011001101101… |
… | …1100101010110101 |
3 | 12211011211020221212 |
4 | 2012123130222311 |
5 | 14104331423021 |
6 | 1011443451205 |
7 | 106614043604 |
oct | 20633345265 |
9 | 5734736855 |
10 | 2255342261 |
11 | a5809a027 |
12 | 52b386b05 |
13 | 29c33a563 |
14 | 175765a3b |
15 | d2eee85b |
hex | 866dcab5 |
2255342261 has 2 divisors, whose sum is σ = 2255342262. Its totient is φ = 2255342260.
The previous prime is 2255342233. The next prime is 2255342263. The reversal of 2255342261 is 1622435522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1641789361 + 613552900 = 40519^2 + 24770^2 .
It is a cyclic number.
It is not a de Polignac number, because 2255342261 - 26 = 2255342197 is a prime.
Together with 2255342263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2255342263) 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, 1127671130 + 1127671131.
It is an arithmetic number, because the mean of its divisors is an integer number (1127671131).
Almost surely, 22255342261 is an apocalyptic number.
It is an amenable number.
2255342261 is a deficient number, since it is larger than the sum of its proper divisors (1).
2255342261 is an equidigital number, since it uses as much as digits as its factorization.
2255342261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 28800, while the sum is 32.
The square root of 2255342261 is about 47490.4438913767. The cubic root of 2255342261 is about 1311.4069651302.
Adding to 2255342261 its reverse (1622435522), we get a palindrome (3877777783).
The spelling of 2255342261 in words is "two billion, two hundred fifty-five million, three hundred forty-two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •