Base | Representation |
---|---|
bin | 101001001000100011110… |
… | …1010011011100111110011 |
3 | 202000110100201110220110111 |
4 | 1102101013222123213303 |
5 | 1220111110043021214 |
6 | 20005043201442151 |
7 | 1122305002616356 |
oct | 122210752334763 |
9 | 22013321426414 |
10 | 5653379267059 |
11 | 188a6482384a7 |
12 | 7737b5340357 |
13 | 32015a9083a4 |
14 | 1578a708c29d |
15 | 9c0cd9435c4 |
hex | 52447a9b9f3 |
5653379267059 has 2 divisors, whose sum is σ = 5653379267060. Its totient is φ = 5653379267058.
The previous prime is 5653379267017. The next prime is 5653379267093. The reversal of 5653379267059 is 9507629733565.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5653379267059 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5653379266985 and 5653379267003.
It is not a weakly prime, because it can be changed into another prime (5653379267759) 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, 2826689633529 + 2826689633530.
It is an arithmetic number, because the mean of its divisors is an integer number (2826689633530).
Almost surely, 25653379267059 is an apocalyptic number.
5653379267059 is a deficient number, since it is larger than the sum of its proper divisors (1).
5653379267059 is an equidigital number, since it uses as much as digits as its factorization.
5653379267059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 321489000, while the sum is 67.
The spelling of 5653379267059 in words is "five trillion, six hundred fifty-three billion, three hundred seventy-nine million, two hundred sixty-seven thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •