Base | Representation |
---|---|
bin | 11110000010101… |
… | …11000110011000 |
3 | 122120012200120220 |
4 | 33001113012120 |
5 | 1004003440000 |
6 | 41001320040 |
7 | 6150043416 |
oct | 1701270630 |
9 | 576180526 |
10 | 252015000 |
11 | 11a28a666 |
12 | 70496020 |
13 | 40299903 |
14 | 256822b6 |
15 | 171d11a0 |
hex | f057198 |
252015000 has 160 divisors (see below), whose sum is σ = 804679920. Its totient is φ = 65728000.
The previous prime is 252014999. The next prime is 252015013. The reversal of 252015000 is 510252.
It is a Harshad number since it is a multiple of its sum of digits (15).
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 39 ways as a sum of consecutive naturals, for example, 794842 + ... + 795158.
Almost surely, 2252015000 is an apocalyptic number.
252015000 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 252015000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (402339960).
252015000 is an abundant number, since it is smaller than the sum of its proper divisors (552664920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252015000 is a wasteful number, since it uses less digits than its factorization.
252015000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399 (or 380 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 252015000 is about 15874.9803149484. The cubic root of 252015000 is about 631.6484919765.
Adding to 252015000 its reverse (510252), we get a palindrome (252525252).
The spelling of 252015000 in words is "two hundred fifty-two million, fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •