Base | Representation |
---|---|
bin | 1110101111111111111… |
… | …1111111000001010000 |
3 | 220020002002120112200100 |
4 | 3223333333333001100 |
5 | 13122432141111243 |
6 | 312224535052400 |
7 | 24210364345200 |
oct | 3537777770120 |
9 | 806062515610 |
10 | 253403066448 |
11 | 98516474464 |
12 | 41140211100 |
13 | 1ab8511968c |
14 | c39c77a400 |
15 | 68d197a0d3 |
hex | 3afffff050 |
253403066448 has 180 divisors, whose sum is σ = 825235931520. Its totient is φ = 72376714368.
The previous prime is 253403066363. The next prime is 253403066503. The reversal of 253403066448 is 844660304352.
It is a super-2 number, since 2×2534030664482 (a number of 24 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 35 ways as a sum of consecutive naturals, for example, 41902561 + ... + 41908607.
It is an arithmetic number, because the mean of its divisors is an integer number (4584644064).
Almost surely, 2253403066448 is an apocalyptic number.
253403066448 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 253403066448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (412617965760).
253403066448 is an abundant number, since it is smaller than the sum of its proper divisors (571832865072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253403066448 is a wasteful number, since it uses less digits than its factorization.
253403066448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12014 (or 11998 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 45.
The spelling of 253403066448 in words is "two hundred fifty-three billion, four hundred three million, sixty-six thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •