Base | Representation |
---|---|
bin | 11110001111000… |
… | …01110000000000 |
3 | 122200020210222211 |
4 | 33013201300000 |
5 | 1004412201423 |
6 | 41100111504 |
7 | 6166555255 |
oct | 1707416000 |
9 | 580223884 |
10 | 253631488 |
11 | 120194100 |
12 | 70b35594 |
13 | 40714606 |
14 | 2598342c |
15 | 1740010d |
hex | f1e1c00 |
253631488 has 132 divisors (see below), whose sum is σ = 588062160. Its totient is φ = 109035520.
The previous prime is 253631471. The next prime is 253631489. The reversal of 253631488 is 884136352.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 253631488.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253631489) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2849748 + ... + 2849836.
Almost surely, 2253631488 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 253631488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294031080).
253631488 is an abundant number, since it is smaller than the sum of its proper divisors (334430672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253631488 is a wasteful number, since it uses less digits than its factorization.
253631488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154 (or 125 counting only the distinct ones).
The product of its digits is 138240, while the sum is 40.
The square root of 253631488 is about 15925.8120044160. The cubic root of 253631488 is about 632.9961324715.
The spelling of 253631488 in words is "two hundred fifty-three million, six hundred thirty-one thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •