Base | Representation |
---|---|
bin | 110001111100100111… |
… | …111111010101111000 |
3 | 12010102121011220220100 |
4 | 301330213333111320 |
5 | 1334313344343100 |
6 | 40345410555400 |
7 | 3606004301661 |
oct | 617447772570 |
9 | 163377156810 |
10 | 53630465400 |
11 | 20820aaa486 |
12 | a488898b60 |
13 | 5098c588c5 |
14 | 284a970368 |
15 | 15dd473400 |
hex | c7c9ff578 |
53630465400 has 72 divisors (see below), whose sum is σ = 180108985680. Its totient is φ = 14301456960.
The previous prime is 53630465393. The next prime is 53630465417. The reversal of 53630465400 is 456403635.
53630465400 is a `hidden beast` number, since 53 + 63 + 0 + 4 + 6 + 540 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 14895552 + ... + 14899151.
It is an arithmetic number, because the mean of its divisors is an integer number (2501513690).
Almost surely, 253630465400 is an apocalyptic number.
53630465400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53630465400 is an abundant number, since it is smaller than the sum of its proper divisors (126478520280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53630465400 is a wasteful number, since it uses less digits than its factorization.
53630465400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29794725 (or 29794713 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
The spelling of 53630465400 in words is "fifty-three billion, six hundred thirty million, four hundred sixty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •