Base | Representation |
---|---|
bin | 100110001000001000010… |
… | …1101011111111110110101 |
3 | 200112221201101202122212102 |
4 | 1030100100231133332311 |
5 | 1141323301424322203 |
6 | 15051142020031445 |
7 | 1050405365012135 |
oct | 114202055377665 |
9 | 20487641678772 |
10 | 5240140464053 |
11 | 17403707554a0 |
12 | 7076a8532585 |
13 | 2c01b25a6301 |
14 | 1418a495aac5 |
15 | 91494b76888 |
hex | 4c410b5ffb5 |
5240140464053 has 64 divisors (see below), whose sum is σ = 6385432559616. Its totient is φ = 4243625856000.
The previous prime is 5240140464049. The next prime is 5240140464079. The reversal of 5240140464053 is 3504640410425.
It is a cyclic number.
It is not a de Polignac number, because 5240140464053 - 22 = 5240140464049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5240140463998 and 5240140464016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5240140460053) 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 in 63 ways as a sum of consecutive naturals, for example, 443284883 + ... + 443296703.
It is an arithmetic number, because the mean of its divisors is an integer number (99772383744).
Almost surely, 25240140464053 is an apocalyptic number.
It is an amenable number.
5240140464053 is a deficient number, since it is larger than the sum of its proper divisors (1145292095563).
5240140464053 is a wasteful number, since it uses less digits than its factorization.
5240140464053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13554.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 5240140464053 its reverse (3504640410425), we get a palindrome (8744780874478).
The spelling of 5240140464053 in words is "five trillion, two hundred forty billion, one hundred forty million, four hundred sixty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •