Base | Representation |
---|---|
bin | 1011001110100110… |
… | …0000010011101100 |
3 | 21210001101011100000 |
4 | 2303221200103230 |
5 | 22133041030100 |
6 | 1215024304300 |
7 | 134455410360 |
oct | 26351402354 |
9 | 7701334300 |
10 | 3014001900 |
11 | 1307364268 |
12 | 701472090 |
13 | 3905777a0 |
14 | 20840d2a0 |
15 | 12990c900 |
hex | b3a604ec |
3014001900 has 864 divisors, whose sum is σ = 12739184640. Its totient is φ = 600929280.
The previous prime is 3014001899. The next prime is 3014001911. The reversal of 3014001900 is 91004103.
It is a super-2 number, since 2×30140019002 = 18168414906407220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 64127677 + ... + 64127723.
Almost surely, 23014001900 is an apocalyptic number.
3014001900 is a gapful number since it is divisible by the number (30) 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 3014001900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6369592320).
3014001900 is an abundant number, since it is smaller than the sum of its proper divisors (9725182740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3014001900 is a wasteful number, since it uses less digits than its factorization.
3014001900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125 (or 106 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
The square root of 3014001900 is about 54899.9262294586. The cubic root of 3014001900 is about 1444.4898923022.
The spelling of 3014001900 in words is "three billion, fourteen million, one thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •