Base | Representation |
---|---|
bin | 1001011010011001… |
… | …11011001111100000 |
3 | 111001011201210010012 |
4 | 10231030323033200 |
5 | 40322123033100 |
6 | 2153234224052 |
7 | 236140412456 |
oct | 45514731740 |
9 | 14034653105 |
10 | 5053330400 |
11 | 2163522a18 |
12 | b90425028 |
13 | 626c11b41 |
14 | 35d1c49d6 |
15 | 1e898d135 |
hex | 12d33b3e0 |
5053330400 has 36 divisors (see below), whose sum is σ = 12336444792. Its totient is φ = 2021331840.
The previous prime is 5053330369. The next prime is 5053330411. The reversal of 5053330400 is 40333505.
It is a super-2 number, since 2×50533304002 = 51072296263128320000, which contains 22 as substring.
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 5 ways as a sum of consecutive naturals, for example, 3157532 + ... + 3159131.
It is an arithmetic number, because the mean of its divisors is an integer number (342679022).
Almost surely, 25053330400 is an apocalyptic number.
5053330400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5053330400 is an abundant number, since it is smaller than the sum of its proper divisors (7283114392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5053330400 is a wasteful number, since it uses less digits than its factorization.
5053330400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6316683 (or 6316670 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 23.
The square root of 5053330400 is about 71086.7807682976. The cubic root of 5053330400 is about 1716.0340388414.
Adding to 5053330400 its reverse (40333505), we get a palindrome (5093663905).
The spelling of 5053330400 in words is "five billion, fifty-three million, three hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •