Base | Representation |
---|---|
bin | 110001011101011011… |
… | …010010101011001100 |
3 | 12002002010021022101021 |
4 | 301131123102223030 |
5 | 1332230400334040 |
6 | 40221432123524 |
7 | 3560020263133 |
oct | 613533225314 |
9 | 162063238337 |
10 | 53107043020 |
11 | 205825a54a9 |
12 | a3615365a4 |
13 | 5014692715 |
14 | 27db23c91a |
15 | 15ac53024a |
hex | c5d6d2acc |
53107043020 has 96 divisors (see below), whose sum is σ = 116916097536. Its totient is φ = 20238336000.
The previous prime is 53107043009. The next prime is 53107043027. The reversal of 53107043020 is 2034070135.
It is a super-3 number, since 3×531070430203 (a number of 33 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (53107043027) 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 31 ways as a sum of consecutive naturals, for example, 44218420 + ... + 44219620.
It is an arithmetic number, because the mean of its divisors is an integer number (1217876016).
Almost surely, 253107043020 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53107043020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58458048768).
53107043020 is an abundant number, since it is smaller than the sum of its proper divisors (63809054516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53107043020 is a wasteful number, since it uses less digits than its factorization.
53107043020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2291 (or 2289 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 25.
The spelling of 53107043020 in words is "fifty-three billion, one hundred seven million, forty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •