Base | Representation |
---|---|
bin | 110001011001011101… |
… | …000101001010011100 |
3 | 12001220110212122121002 |
4 | 301121131011022130 |
5 | 1332111320344400 |
6 | 40211051525432 |
7 | 3555250662506 |
oct | 613135051234 |
9 | 161813778532 |
10 | 53040403100 |
11 | 20548a19993 |
12 | a343159878 |
13 | 500392c409 |
14 | 27d2452d76 |
15 | 15a6769ed5 |
hex | c5974529c |
53040403100 has 36 divisors (see below), whose sum is σ = 115119262104. Its totient is φ = 21212182080.
The previous prime is 53040403067. The next prime is 53040403139. The reversal of 53040403100 is 130404035.
It is a super-2 number, since 2×530404031002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 518387 + ... + 612213.
Almost surely, 253040403100 is an apocalyptic number.
53040403100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53040403100 is an abundant number, since it is smaller than the sum of its proper divisors (62078859004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53040403100 is a wasteful number, since it uses less digits than its factorization.
53040403100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99494 (or 99487 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
Adding to 53040403100 its reverse (130404035), we get a palindrome (53170807135).
The spelling of 53040403100 in words is "fifty-three billion, forty million, four hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •