Base | Representation |
---|---|
bin | 11110001101111… |
… | …00011100011000 |
3 | 122122222001101021 |
4 | 33012330130120 |
5 | 1004342304210 |
6 | 41052532224 |
7 | 6165350620 |
oct | 1706743430 |
9 | 578861337 |
10 | 253478680 |
11 | 12009a314 |
12 | 70a81074 |
13 | 4068cbb0 |
14 | 25943880 |
15 | 173bebda |
hex | f1bc718 |
253478680 has 128 divisors (see below), whose sum is σ = 711244800. Its totient is φ = 79160832.
The previous prime is 253478671. The next prime is 253478681. The reversal of 253478680 is 86874352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253478681) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 301701 + ... + 302539.
It is an arithmetic number, because the mean of its divisors is an integer number (5556600).
Almost surely, 2253478680 is an apocalyptic number.
253478680 is a gapful number since it is divisible by the number (20) 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 253478680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (355622400).
253478680 is an abundant number, since it is smaller than the sum of its proper divisors (457766120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253478680 is a wasteful number, since it uses less digits than its factorization.
253478680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953 (or 949 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 43.
The square root of 253478680 is about 15921.0137868165. The cubic root of 253478680 is about 632.8689843459.
The spelling of 253478680 in words is "two hundred fifty-three million, four hundred seventy-eight thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •