Base | Representation |
---|---|
bin | 111100011111011… |
… | …000000010101100 |
3 | 2121201122010022122 |
4 | 330133120002230 |
5 | 4034300423100 |
6 | 244411532112 |
7 | 34102102250 |
oct | 7437300254 |
9 | 2551563278 |
10 | 1014857900 |
11 | 480951841 |
12 | 243a5a038 |
13 | 13233cc44 |
14 | 98ad8260 |
15 | 5e168985 |
hex | 3c7d80ac |
1014857900 has 72 divisors (see below), whose sum is σ = 2603687520. Its totient is φ = 335946240.
The previous prime is 1014857869. The next prime is 1014857927. The reversal of 1014857900 is 97584101.
1014857900 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 (35).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4697 + ... + 45296.
Almost surely, 21014857900 is an apocalyptic number.
1014857900 is a gapful number since it is divisible by the number (10) 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 1014857900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1301843760).
1014857900 is an abundant number, since it is smaller than the sum of its proper divisors (1588829620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1014857900 is a wasteful number, since it uses less digits than its factorization.
1014857900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50043 (or 50036 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 35.
The square root of 1014857900 is about 31856.8344315627. The cubic root of 1014857900 is about 1004.9283052409.
The spelling of 1014857900 in words is "one billion, fourteen million, eight hundred fifty-seven thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •