Base | Representation |
---|---|
bin | 111011011001001… |
… | …0100011000111000 |
3 | 12010212222220212121 |
4 | 1312302110120320 |
5 | 13040140332300 |
6 | 525430451024 |
7 | 100246250332 |
oct | 16662243070 |
9 | 5125886777 |
10 | 1992902200 |
11 | 932a39a13 |
12 | 477503a74 |
13 | 259b60793 |
14 | 14c96c452 |
15 | b9e5e81a |
hex | 76c94638 |
1992902200 has 48 divisors (see below), whose sum is σ = 4645774080. Its totient is φ = 795048960.
The previous prime is 1992902173. The next prime is 1992902201. The reversal of 1992902200 is 22092991.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1992902201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 63592 + ... + 89608.
It is an arithmetic number, because the mean of its divisors is an integer number (96786960).
Almost surely, 21992902200 is an apocalyptic number.
1992902200 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 1992902200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2322887040).
1992902200 is an abundant number, since it is smaller than the sum of its proper divisors (2652871880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1992902200 is a wasteful number, since it uses less digits than its factorization.
1992902200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26416 (or 26407 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 34.
The square root of 1992902200 is about 44641.9332018675. The cubic root of 1992902200 is about 1258.4288386594.
The spelling of 1992902200 in words is "one billion, nine hundred ninety-two million, nine hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •