Base | Representation |
---|---|
bin | 100000110100001011100… |
… | …110010110010000101111 |
3 | 21222120200110222212102102 |
4 | 200310023212112100233 |
5 | 243421321410314211 |
6 | 4443542355445315 |
7 | 321631205260361 |
oct | 40641346262057 |
9 | 7876613885372 |
10 | 2255052432431 |
11 | 79a3a9344327 |
12 | 3050645b683b |
13 | 13485c2ac446 |
14 | 7b2062d0d31 |
15 | 3d9d4658a3b |
hex | 20d0b99642f |
2255052432431 has 2 divisors, whose sum is σ = 2255052432432. Its totient is φ = 2255052432430.
The previous prime is 2255052432427. The next prime is 2255052432433. The reversal of 2255052432431 is 1342342505522.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2255052432431 - 22 = 2255052432427 is a prime.
It is a super-2 number, since 2×22550524324312 (a number of 26 digits) contains 22 as substring.
Together with 2255052432433, 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 (2255052432433) 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, 1127526216215 + 1127526216216.
It is an arithmetic number, because the mean of its divisors is an integer number (1127526216216).
Almost surely, 22255052432431 is an apocalyptic number.
2255052432431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2255052432431 is an equidigital number, since it uses as much as digits as its factorization.
2255052432431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288000, while the sum is 38.
Adding to 2255052432431 its reverse (1342342505522), we get a palindrome (3597394937953).
The spelling of 2255052432431 in words is "two trillion, two hundred fifty-five billion, fifty-two million, four hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •