Base | Representation |
---|---|
bin | 11101110011110… |
… | …00100101011000 |
3 | 122102112002222022 |
4 | 32321320211120 |
5 | 1003003230000 |
6 | 40451314012 |
7 | 6124301216 |
oct | 1671704530 |
9 | 572462868 |
10 | 250055000 |
11 | 119171028 |
12 | 6b8ab908 |
13 | 3ca61750 |
14 | 252d1cb6 |
15 | 16e45585 |
hex | ee78958 |
250055000 has 80 divisors (see below), whose sum is σ = 631110480. Its totient is φ = 92304000.
The previous prime is 250054997. The next prime is 250055017. The reversal of 250055000 is 550052.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 250055000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 63077 + ... + 66923.
It is an arithmetic number, because the mean of its divisors is an integer number (7888881).
Almost surely, 2250055000 is an apocalyptic number.
250055000 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 250055000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (315555240).
250055000 is an abundant number, since it is smaller than the sum of its proper divisors (381055480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250055000 is a wasteful number, since it uses less digits than its factorization.
250055000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3886 (or 3867 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 17.
The square root of 250055000 is about 15813.1274579066. The cubic root of 250055000 is about 630.0067186652.
The spelling of 250055000 in words is "two hundred fifty million, fifty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •