Base | Representation |
---|---|
bin | 101011010100001110100… |
… | …0011111100100010000001 |
3 | 210002010112120021220110001 |
4 | 1112220131003330202001 |
5 | 1240014340413332024 |
6 | 20354525222240001 |
7 | 1153053425103031 |
oct | 126503503744201 |
9 | 23063476256401 |
10 | 5953312245889 |
11 | 19958706187a8 |
12 | 801960286001 |
13 | 34251989c2a8 |
14 | 1681db3458c1 |
15 | a4cd52b4244 |
hex | 56a1d0fc881 |
5953312245889 has 2 divisors, whose sum is σ = 5953312245890. Its totient is φ = 5953312245888.
The previous prime is 5953312245817. The next prime is 5953312245919. The reversal of 5953312245889 is 9885422133595.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5904982620289 + 48329625600 = 2430017^2 + 219840^2 .
It is a cyclic number.
It is not a de Polignac number, because 5953312245889 - 27 = 5953312245761 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5953312245889.
It is not a weakly prime, because it can be changed into another prime (5953312245289) 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, 2976656122944 + 2976656122945.
It is an arithmetic number, because the mean of its divisors is an integer number (2976656122945).
Almost surely, 25953312245889 is an apocalyptic number.
It is an amenable number.
5953312245889 is a deficient number, since it is larger than the sum of its proper divisors (1).
5953312245889 is an equidigital number, since it uses as much as digits as its factorization.
5953312245889 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 93312000, while the sum is 64.
The spelling of 5953312245889 in words is "five trillion, nine hundred fifty-three billion, three hundred twelve million, two hundred forty-five thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •