Base | Representation |
---|---|
bin | 110001010111111100… |
… | …101101100001001001 |
3 | 12001211201100011201110 |
4 | 301113330231201021 |
5 | 1332033333443200 |
6 | 40204350240533 |
7 | 3554523154422 |
oct | 612774554111 |
9 | 161751304643 |
10 | 53015140425 |
11 | 20535734745 |
12 | a3367b6149 |
13 | 4ccb6257a0 |
14 | 27ccd58649 |
15 | 15a4429b50 |
hex | c57f2d849 |
53015140425 has 48 divisors (see below), whose sum is σ = 94433205888. Its totient is φ = 26088960000.
The previous prime is 53015140357. The next prime is 53015140427. The reversal of 53015140425 is 52404151035.
It is not a de Polignac number, because 53015140425 - 233 = 44425205833 is a prime.
It is a super-2 number, since 2×530151404252 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53015140392 and 53015140401.
It is not an unprimeable number, because it can be changed into a prime (53015140427) 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 in 47 ways as a sum of consecutive naturals, for example, 2674300 + ... + 2694050.
It is an arithmetic number, because the mean of its divisors is an integer number (1967358456).
Almost surely, 253015140425 is an apocalyptic number.
It is an amenable number.
53015140425 is a deficient number, since it is larger than the sum of its proper divisors (41418065463).
53015140425 is a wasteful number, since it uses less digits than its factorization.
53015140425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22530 (or 22525 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
The spelling of 53015140425 in words is "fifty-three billion, fifteen million, one hundred forty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •