Base | Representation |
---|---|
bin | 1110110000110110011… |
… | …1101101100111110000 |
3 | 220020200000120110212020 |
4 | 3230031213231213300 |
5 | 13123414141203002 |
6 | 312303341031440 |
7 | 24216140620260 |
oct | 3541547554760 |
9 | 806600513766 |
10 | 253631584752 |
11 | 98623465667 |
12 | 411a4855580 |
13 | 1abc057a400 |
14 | c3c0c637a0 |
15 | 68e6a692bc |
hex | 3b0d9ed9f0 |
253631584752 has 480 divisors, whose sum is σ = 846843655680. Its totient is φ = 63984660480.
The previous prime is 253631584699. The next prime is 253631584799. The reversal of 253631584752 is 257485136352.
It is a junction number, because it is equal to n+sod(n) for n = 253631584695 and 253631584704.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 128160499 + ... + 128162477.
It is an arithmetic number, because the mean of its divisors is an integer number (1764257616).
Almost surely, 2253631584752 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 253631584752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (423421827840).
253631584752 is an abundant number, since it is smaller than the sum of its proper divisors (593212070928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253631584752 is a wasteful number, since it uses less digits than its factorization.
253631584752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2121 (or 2102 counting only the distinct ones).
The product of its digits is 6048000, while the sum is 51.
It can be divided in two parts, 25363 and 1584752, that added together give a triangular number (1610115 = T1794).
The spelling of 253631584752 in words is "two hundred fifty-three billion, six hundred thirty-one million, five hundred eighty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •