Base | Representation |
---|---|
bin | 100100100001110001110… |
… | …0101011110100000100101 |
3 | 122202221101010111221010111 |
4 | 1021003203211132200211 |
5 | 1124223124023212203 |
6 | 14402151250253021 |
7 | 1025464464240232 |
oct | 111034345364045 |
9 | 18687333457114 |
10 | 5020340054053 |
11 | 1666129098195 |
12 | 690b85887171 |
13 | 2a5554051ccc |
14 | 134db2caa789 |
15 | 8a8cd25e26d |
hex | 490e395e825 |
5020340054053 has 2 divisors, whose sum is σ = 5020340054054. Its totient is φ = 5020340054052.
The previous prime is 5020340053987. The next prime is 5020340054077. The reversal of 5020340054053 is 3504500430205.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4220304618244 + 800035435809 = 2054338^2 + 894447^2 .
It is a cyclic number.
It is not a de Polignac number, because 5020340054053 - 229 = 5019803183141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5020340055053) 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, 2510170027026 + 2510170027027.
It is an arithmetic number, because the mean of its divisors is an integer number (2510170027027).
Almost surely, 25020340054053 is an apocalyptic number.
It is an amenable number.
5020340054053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5020340054053 is an equidigital number, since it uses as much as digits as its factorization.
5020340054053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 31.
Adding to 5020340054053 its reverse (3504500430205), we get a palindrome (8524840484258).
The spelling of 5020340054053 in words is "five trillion, twenty billion, three hundred forty million, fifty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •