Base | Representation |
---|---|
bin | 11110000111100… |
… | …10111110100000 |
3 | 122121102010102000 |
4 | 33003302332200 |
5 | 1004134402342 |
6 | 41023124000 |
7 | 6155343021 |
oct | 1703627640 |
9 | 577363360 |
10 | 252653472 |
11 | 11a686325 |
12 | 70743600 |
13 | 404613c6 |
14 | 257aac48 |
15 | 172aa44c |
hex | f0f2fa0 |
252653472 has 96 divisors (see below), whose sum is σ = 760757760. Its totient is φ = 81492480.
The previous prime is 252653447. The next prime is 252653519. The reversal of 252653472 is 274356252.
252653472 is a `hidden beast` number, since 2 + 52 + 6 + 534 + 72 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22068 + ... + 31500.
It is an arithmetic number, because the mean of its divisors is an integer number (7924560).
Almost surely, 2252653472 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 252653472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (380378880).
252653472 is an abundant number, since it is smaller than the sum of its proper divisors (508104288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252653472 is a wasteful number, since it uses less digits than its factorization.
252653472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9483 (or 9469 counting only the distinct ones).
The product of its digits is 100800, while the sum is 36.
The square root of 252653472 is about 15895.0769737048. The cubic root of 252653472 is about 632.1814626072.
The spelling of 252653472 in words is "two hundred fifty-two million, six hundred fifty-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •