Base | Representation |
---|---|
bin | 11101111001011… |
… | …00000010110110 |
3 | 122110220110022010 |
4 | 32330230002312 |
5 | 1003200240240 |
6 | 40515145050 |
7 | 6133452246 |
oct | 1674540266 |
9 | 573813263 |
10 | 250790070 |
11 | 119623323 |
12 | 6bba5186 |
13 | 3cc5b1bb |
14 | 25443b26 |
15 | 1703d280 |
hex | ef2c0b6 |
250790070 has 64 divisors (see below), whose sum is σ = 624563136. Its totient is φ = 64396800.
The previous prime is 250790051. The next prime is 250790077. The reversal of 250790070 is 70097052.
It is a happy number.
250790070 is digitally balanced in base 3, 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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (250790077) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 110992 + ... + 113228.
It is an arithmetic number, because the mean of its divisors is an integer number (9758799).
Almost surely, 2250790070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 250790070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312281568).
250790070 is an abundant number, since it is smaller than the sum of its proper divisors (373773066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250790070 is a wasteful number, since it uses less digits than its factorization.
250790070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2385.
The product of its (nonzero) digits is 4410, while the sum is 30.
The square root of 250790070 is about 15836.3527998084. The cubic root of 250790070 is about 630.6234443161.
The spelling of 250790070 in words is "two hundred fifty million, seven hundred ninety thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •