Base | Representation |
---|---|
bin | 110001011101001000… |
… | …100110101000101000 |
3 | 12002001210001102020120 |
4 | 301131020212220220 |
5 | 1332223122102130 |
6 | 40221135123240 |
7 | 3556630530321 |
oct | 613510465050 |
9 | 162053042216 |
10 | 53102144040 |
11 | 2057a859860 |
12 | a35b973520 |
13 | 501366890a |
14 | 27da725448 |
15 | 15abdb3910 |
hex | c5d226a28 |
53102144040 has 128 divisors (see below), whose sum is σ = 175413496320. Its totient is φ = 12752902400.
The previous prime is 53102144009. The next prime is 53102144083. The reversal of 53102144040 is 4044120135.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 53102144040.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46746 + ... + 329225.
It is an arithmetic number, because the mean of its divisors is an integer number (1370417940).
Almost surely, 253102144040 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 53102144040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87706748160).
53102144040 is an abundant number, since it is smaller than the sum of its proper divisors (122311352280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53102144040 is a wasteful number, since it uses less digits than its factorization.
53102144040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376103 (or 376099 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 53102144040 its reverse (4044120135), we get a palindrome (57146264175).
The spelling of 53102144040 in words is "fifty-three billion, one hundred two million, one hundred forty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •