Base | Representation |
---|---|
bin | 1110101100111101100… |
… | …1100111000111001000 |
3 | 220010222021022200010012 |
4 | 3223033121213013020 |
5 | 13114244422410210 |
6 | 312012011011052 |
7 | 24151234013420 |
oct | 3531731470710 |
9 | 803867280105 |
10 | 252587700680 |
11 | 98138199057 |
12 | 40b53139a88 |
13 | 1aa85216823 |
14 | c322371480 |
15 | 68850ba305 |
hex | 3acf6671c8 |
252587700680 has 128 divisors (see below), whose sum is σ = 689961888000. Its totient is φ = 81241325568.
The previous prime is 252587700641. The next prime is 252587700683. The reversal of 252587700680 is 86007785252.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (252587700683) 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, 1374896 + ... + 1547744.
It is an arithmetic number, because the mean of its divisors is an integer number (5390327250).
Almost surely, 2252587700680 is an apocalyptic number.
252587700680 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 252587700680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (344980944000).
252587700680 is an abundant number, since it is smaller than the sum of its proper divisors (437374187320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252587700680 is a wasteful number, since it uses less digits than its factorization.
252587700680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173191 (or 173187 counting only the distinct ones).
The product of its (nonzero) digits is 1881600, while the sum is 50.
The spelling of 252587700680 in words is "two hundred fifty-two billion, five hundred eighty-seven million, seven hundred thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •