Base | Representation |
---|---|
bin | 10001101110100110… |
… | …110111010001010000 |
3 | 1211010121202011200000 |
4 | 101232212313101100 |
5 | 302441100111200 |
6 | 12424513530000 |
7 | 1242501340440 |
oct | 215646672120 |
9 | 54117664600 |
10 | 19035550800 |
11 | 8089088072 |
12 | 3832b73900 |
13 | 1a44937136 |
14 | cc8190120 |
15 | 76625d300 |
hex | 46e9b7450 |
19035550800 has 720 divisors, whose sum is σ = 79352337792. Its totient is φ = 4292352000.
The previous prime is 19035550799. The next prime is 19035550841. The reversal of 19035550800 is 805553091.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (720).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent 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 143 ways as a sum of consecutive naturals, for example, 68720262 + ... + 68720538.
Almost surely, 219035550800 is an apocalyptic number.
19035550800 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 19035550800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39676168896).
19035550800 is an abundant number, since it is smaller than the sum of its proper divisors (60316786992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19035550800 is a wasteful number, since it uses less digits than its factorization.
19035550800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418 (or 395 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 19035550800 in words is "nineteen billion, thirty-five million, five hundred fifty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •