Base | Representation |
---|---|
bin | 11101110011010… |
… | …11001100010010 |
3 | 122102102022201200 |
4 | 32321223030102 |
5 | 1003000001041 |
6 | 40450212030 |
7 | 6123652254 |
oct | 1671531422 |
9 | 572368650 |
10 | 250000146 |
11 | 1191338a0 |
12 | 6b884016 |
13 | 3ca427a6 |
14 | 252b9cd4 |
15 | 16e341b6 |
hex | ee6b312 |
250000146 has 48 divisors (see below), whose sum is σ = 593555040. Its totient is φ = 75418560.
The previous prime is 250000141. The next prime is 250000189. The reversal of 250000146 is 641000052.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (250000141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43425 + ... + 48843.
It is an arithmetic number, because the mean of its divisors is an integer number (12365730).
Almost surely, 2250000146 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 250000146, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (296777520).
250000146 is an abundant number, since it is smaller than the sum of its proper divisors (343554894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250000146 is a wasteful number, since it uses less digits than its factorization.
250000146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5671 (or 5668 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 250000146 is about 15811.3929177666. The cubic root of 250000146 is about 629.9606475797.
Adding to 250000146 its reverse (641000052), we get a palindrome (891000198).
The spelling of 250000146 in words is "two hundred fifty million, one hundred forty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •