Base | Representation |
---|---|
bin | 110001111100100110… |
… | …110011010100111000 |
3 | 12010102120121002210111 |
4 | 301330212303110320 |
5 | 1334313304412130 |
6 | 40345400154104 |
7 | 3606001534141 |
oct | 617446632470 |
9 | 163376532714 |
10 | 53630154040 |
11 | 20820907561 |
12 | a488768934 |
13 | 5098b79c78 |
14 | 284a8ccac8 |
15 | 15dd41102a |
hex | c7c9b3538 |
53630154040 has 32 divisors (see below), whose sum is σ = 120942756000. Its totient is φ = 21403188864.
The previous prime is 53630154037. The next prime is 53630154041. The reversal of 53630154040 is 4045103635.
It is a junction number, because it is equal to n+sod(n) for n = 53630153993 and 53630154011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53630154041) 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 7 ways as a sum of consecutive naturals, for example, 1509495 + ... + 1544614.
It is an arithmetic number, because the mean of its divisors is an integer number (3779461125).
Almost surely, 253630154040 is an apocalyptic number.
It is an amenable number.
53630154040 is an abundant number, since it is smaller than the sum of its proper divisors (67312601960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53630154040 is a wasteful number, since it uses less digits than its factorization.
53630154040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3054559 (or 3054555 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 53630154040 its reverse (4045103635), we get a palindrome (57675257675).
The spelling of 53630154040 in words is "fifty-three billion, six hundred thirty million, one hundred fifty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •