Base | Representation |
---|---|
bin | 110001010111101101… |
… | …011001000001010110 |
3 | 12001211102210010122110 |
4 | 301113231121001112 |
5 | 1332031321434220 |
6 | 40204124211450 |
7 | 3554444056554 |
oct | 612755310126 |
9 | 161742703573 |
10 | 53011124310 |
11 | 20533441341 |
12 | a335399b86 |
13 | 4cca84a7a1 |
14 | 27cc5d0bd4 |
15 | 15a3dd4be0 |
hex | c57b59056 |
53011124310 has 128 divisors (see below), whose sum is σ = 137678745600. Its totient is φ = 13014743040.
The previous prime is 53011124297. The next prime is 53011124351. The reversal of 53011124310 is 1342111035.
53011124310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×530111243102 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4385575 + ... + 4397645.
It is an arithmetic number, because the mean of its divisors is an integer number (1075615200).
Almost surely, 253011124310 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53011124310, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68839372800).
53011124310 is an abundant number, since it is smaller than the sum of its proper divisors (84667621290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53011124310 is a wasteful number, since it uses less digits than its factorization.
53011124310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12286.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 53011124310 its reverse (1342111035), we get a palindrome (54353235345).
The spelling of 53011124310 in words is "fifty-three billion, eleven million, one hundred twenty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •