Base | Representation |
---|---|
bin | 11110000111101… |
… | …01000100011000 |
3 | 122121102120011100 |
4 | 33003311010120 |
5 | 1004140141130 |
6 | 41023231400 |
7 | 6155410011 |
oct | 1703650430 |
9 | 577376140 |
10 | 252662040 |
11 | 11a691804 |
12 | 70748560 |
13 | 40465287 |
14 | 257b0008 |
15 | 172acc60 |
hex | f0f5118 |
252662040 has 96 divisors (see below), whose sum is σ = 823914000. Its totient is φ = 67150080.
The previous prime is 252662029. The next prime is 252662087. The reversal of 252662040 is 40266252.
It is a junction number, because it is equal to n+sod(n) for n = 252661995 and 252662013.
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 23 ways as a sum of consecutive naturals, for example, 124635 + ... + 126645.
Almost surely, 2252662040 is an apocalyptic number.
252662040 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 252662040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (411957000).
252662040 is an abundant number, since it is smaller than the sum of its proper divisors (571251960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252662040 is a wasteful number, since it uses less digits than its factorization.
252662040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2377 (or 2370 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 252662040 is about 15895.3464888313. The cubic root of 252662040 is about 632.1886087186.
The spelling of 252662040 in words is "two hundred fifty-two million, six hundred sixty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •