Base | Representation |
---|---|
bin | 10010011100011101… |
… | …110100101100100100 |
3 | 1220010020110211111100 |
4 | 102130131310230210 |
5 | 311030030323100 |
6 | 13033120240100 |
7 | 1300533103104 |
oct | 223435645444 |
9 | 56106424440 |
10 | 19804932900 |
11 | 8443406245 |
12 | 3a08770030 |
13 | 1b38159a0c |
14 | d5c429204 |
15 | 7ada88400 |
hex | 49c774b24 |
19804932900 has 81 divisors (see below), whose sum is σ = 62090698033. Its totient is φ = 5280189600.
The previous prime is 19804932883. The next prime is 19804932941. The reversal of 19804932900 is 923940891.
The square root of 19804932900 is 140730.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 7129775844 + 12675157056 = 84438^2 + 112584^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4219555 + ... + 4224245.
Almost surely, 219804932900 is an apocalyptic number.
19804932900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
19804932900 is the 140730-th square number.
It is an amenable number.
19804932900 is an abundant number, since it is smaller than the sum of its proper divisors (42285765133).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19804932900 is an equidigital number, since it uses as much as digits as its factorization.
19804932900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9402 (or 4701 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 45.
The spelling of 19804932900 in words is "nineteen billion, eight hundred four million, nine hundred thirty-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •