Base | Representation |
---|---|
bin | 11101111001100… |
… | …01011010101000 |
3 | 122110221120111000 |
4 | 32330301122220 |
5 | 1003201441242 |
6 | 40515435000 |
7 | 6133603350 |
oct | 1674613250 |
9 | 573846430 |
10 | 250812072 |
11 | 119638905 |
12 | 6bbb5a60 |
13 | 3cc68214 |
14 | 2544bb60 |
15 | 17044a4c |
hex | ef316a8 |
250812072 has 128 divisors (see below), whose sum is σ = 822067200. Its totient is φ = 69336000.
The previous prime is 250812071. The next prime is 250812083. The reversal of 250812072 is 270218052.
It is a super-3 number, since 3×2508120723 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (250812071) 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, 44197 + ... + 49547.
It is an arithmetic number, because the mean of its divisors is an integer number (6422400).
Almost surely, 2250812072 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 250812072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (411033600).
250812072 is an abundant number, since it is smaller than the sum of its proper divisors (571255128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250812072 is a wasteful number, since it uses less digits than its factorization.
250812072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5404 (or 5394 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 250812072 is about 15837.0474520979. The cubic root of 250812072 is about 630.6418854653.
The spelling of 250812072 in words is "two hundred fifty million, eight hundred twelve thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •