Base | Representation |
---|---|
bin | 100110011010… |
… | …1001111001000 |
3 | 1101220021020222 |
4 | 1030311033020 |
5 | 20124003000 |
6 | 1555405212 |
7 | 333124055 |
oct | 114651710 |
9 | 41807228 |
10 | 20141000 |
11 | 10407260 |
12 | 68b3808 |
13 | 4232669 |
14 | 296402c |
15 | 1b7ca85 |
hex | 13353c8 |
20141000 has 64 divisors (see below), whose sum is σ = 51442560. Its totient is φ = 7320000.
The previous prime is 20140999. The next prime is 20141003. The reversal of 20141000 is 14102.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (20141003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10085 + ... + 11915.
It is an arithmetic number, because the mean of its divisors is an integer number (803790).
Almost surely, 220141000 is an apocalyptic number.
20141000 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 20141000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25721280).
20141000 is an abundant number, since it is smaller than the sum of its proper divisors (31301560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20141000 is a wasteful number, since it uses less digits than its factorization.
20141000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1863 (or 1849 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 20141000 is about 4487.8725472099. The cubic root of 20141000 is about 272.0781566060.
Adding to 20141000 its reverse (14102), we get a palindrome (20155102).
The spelling of 20141000 in words is "twenty million, one hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •