Base | Representation |
---|---|
bin | 101001000100110011001… |
… | …1111100001101010111101 |
3 | 201222200112010021021022122 |
4 | 1102021212133201222331 |
5 | 1214443041440123412 |
6 | 20001230143452325 |
7 | 1121600650036622 |
oct | 122114637415275 |
9 | 21880463237278 |
10 | 5645306567357 |
11 | 1887185425756 |
12 | 7721218b70a5 |
13 | 31c4722bc9c2 |
14 | 15733cc9c349 |
15 | 9bca9d87572 |
hex | 522667e1abd |
5645306567357 has 2 divisors, whose sum is σ = 5645306567358. Its totient is φ = 5645306567356.
The previous prime is 5645306567309. The next prime is 5645306567389. The reversal of 5645306567357 is 7537656035465.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5138114761081 + 507191806276 = 2266741^2 + 712174^2 .
It is a cyclic number.
It is not a de Polignac number, because 5645306567357 - 218 = 5645306305213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5645306567357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5645306567557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2822653283678 + 2822653283679.
It is an arithmetic number, because the mean of its divisors is an integer number (2822653283679).
Almost surely, 25645306567357 is an apocalyptic number.
It is an amenable number.
5645306567357 is a deficient number, since it is larger than the sum of its proper divisors (1).
5645306567357 is an equidigital number, since it uses as much as digits as its factorization.
5645306567357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 238140000, while the sum is 62.
The spelling of 5645306567357 in words is "five trillion, six hundred forty-five billion, three hundred six million, five hundred sixty-seven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •