Base | Representation |
---|---|
bin | 11001101010010101010001… |
… | …11010100101110110001101 |
3 | 21101210122222200120102120221 |
4 | 30311022220322211312031 |
5 | 24344022333223012014 |
6 | 320003345301511341 |
7 | 14612640560033554 |
oct | 1465125072456615 |
9 | 241718880512527 |
10 | 56430114266509 |
11 | 16a86971411aa5 |
12 | 63b464b112551 |
13 | 256444c3534c9 |
14 | dd1336c6ad9b |
15 | 67cd2418bb24 |
hex | 3352a8ea5d8d |
56430114266509 has 2 divisors, whose sum is σ = 56430114266510. Its totient is φ = 56430114266508.
The previous prime is 56430114266507. The next prime is 56430114266521. The reversal of 56430114266509 is 90566241103465.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56423082940900 + 7031325609 = 7511530^2 + 83853^2 .
It is a cyclic number.
It is not a de Polignac number, because 56430114266509 - 21 = 56430114266507 is a prime.
It is a super-2 number, since 2×564301142665092 (a number of 28 digits) contains 22 as substring.
Together with 56430114266507, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56430114266507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28215057133254 + 28215057133255.
It is an arithmetic number, because the mean of its divisors is an integer number (28215057133255).
Almost surely, 256430114266509 is an apocalyptic number.
It is an amenable number.
56430114266509 is a deficient number, since it is larger than the sum of its proper divisors (1).
56430114266509 is an equidigital number, since it uses as much as digits as its factorization.
56430114266509 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4665600, while the sum is 52.
The spelling of 56430114266509 in words is "fifty-six trillion, four hundred thirty billion, one hundred fourteen million, two hundred sixty-six thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •