Base | Representation |
---|---|
bin | 1110101110101100010… |
… | …0101110000010000000 |
3 | 220012011121221210220120 |
4 | 3223223010232002000 |
5 | 13121222302023143 |
6 | 312130034140240 |
7 | 24165602251161 |
oct | 3535304560200 |
9 | 805147853816 |
10 | 253051986048 |
11 | 98356281574 |
12 | 41062721680 |
13 | 1ab2a4757b4 |
14 | c367cab768 |
15 | 68b0c2b383 |
hex | 3aeb12e080 |
253051986048 has 128 divisors (see below), whose sum is σ = 712272528000. Its totient is φ = 79325970432.
The previous prime is 253051986041. The next prime is 253051986059. The reversal of 253051986048 is 840689150352.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (253051986041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8595738 + ... + 8625126.
It is an arithmetic number, because the mean of its divisors is an integer number (5564629125).
Almost surely, 2253051986048 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 253051986048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (356136264000).
253051986048 is an abundant number, since it is smaller than the sum of its proper divisors (459220541952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253051986048 is a wasteful number, since it uses less digits than its factorization.
253051986048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30742 (or 30730 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 51.
The spelling of 253051986048 in words is "two hundred fifty-three billion, fifty-one million, nine hundred eighty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •