Base | Representation |
---|---|
bin | 11110010001110… |
… | …01111100000000 |
3 | 122200221011111012 |
4 | 33020321330000 |
5 | 1010010231304 |
6 | 41111540052 |
7 | 6202621340 |
oct | 1710717400 |
9 | 580834435 |
10 | 253992704 |
11 | 120410529 |
12 | 7108a628 |
13 | 4080cb54 |
14 | 25a38d20 |
15 | 1747216e |
hex | f239f00 |
253992704 has 72 divisors (see below), whose sum is σ = 593724768. Its totient is φ = 106168320.
The previous prime is 253992689. The next prime is 253992719. The reversal of 253992704 is 407299352.
It is an interprime number because it is at equal distance from previous prime (253992689) and next prime (253992719).
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71744 + ... + 75200.
Almost surely, 2253992704 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 253992704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (296862384).
253992704 is an abundant number, since it is smaller than the sum of its proper divisors (339732064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253992704 is an equidigital number, since it uses as much as digits as its factorization.
253992704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3521 (or 3507 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 41.
The square root of 253992704 is about 15937.1485529878. The cubic root of 253992704 is about 633.2964893310.
The spelling of 253992704 in words is "two hundred fifty-three million, nine hundred ninety-two thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •