Base | Representation |
---|---|
bin | 11101111000011… |
… | …01110001000010 |
3 | 122110200011011210 |
4 | 32330031301002 |
5 | 1003132303200 |
6 | 40512350550 |
7 | 6132424545 |
oct | 1674156102 |
9 | 573604153 |
10 | 250666050 |
11 | 119549128 |
12 | 6bb45456 |
13 | 3cc1690b |
14 | 2541085c |
15 | 17016650 |
hex | ef0dc42 |
250666050 has 96 divisors (see below), whose sum is σ = 658797120. Its totient is φ = 62899200.
The previous prime is 250666033. The next prime is 250666061. The reversal of 250666050 is 50666052.
250666050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 250665999 and 250666017.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 800694 + ... + 801006.
It is an arithmetic number, because the mean of its divisors is an integer number (6862470).
Almost surely, 2250666050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 250666050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (329398560).
250666050 is an abundant number, since it is smaller than the sum of its proper divisors (408131070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250666050 is a wasteful number, since it uses less digits than its factorization.
250666050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 628 (or 623 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 250666050 is about 15832.4366412754. The cubic root of 250666050 is about 630.5194757988.
The spelling of 250666050 in words is "two hundred fifty million, six hundred sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •