Base | Representation |
---|---|
bin | 11110001100001… |
… | …10100101000000 |
3 | 122122112211201201 |
4 | 33012012211000 |
5 | 1004313224143 |
6 | 41044110544 |
7 | 6163441441 |
oct | 1706064500 |
9 | 578484651 |
10 | 253258048 |
11 | 11aa5957a |
12 | 70995454 |
13 | 40613644 |
14 | 258c72c8 |
15 | 1737964d |
hex | f186940 |
253258048 has 42 divisors (see below), whose sum is σ = 508846074. Its totient is φ = 125063424.
The previous prime is 253258039. The next prime is 253258051. The reversal of 253258048 is 840852352.
It can be written as a sum of positive squares in only one way, i.e., 219988224 + 33269824 = 14832^2 + 5768^2 .
It is a junction number, because it is equal to n+sod(n) for n = 253257998 and 253258016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 678790 + ... + 679162.
Almost surely, 2253258048 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 253258048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (254423037).
253258048 is an abundant number, since it is smaller than the sum of its proper divisors (255588026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253258048 is an equidigital number, since it uses as much as digits as its factorization.
253258048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591 (or 478 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 37.
The square root of 253258048 is about 15914.0833226422. The cubic root of 253258048 is about 632.6853111973.
The spelling of 253258048 in words is "two hundred fifty-three million, two hundred fifty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •