Base | Representation |
---|---|
bin | 10001110010100011… |
… | …101010010010111100 |
3 | 1211022020110000001020 |
4 | 101302203222102330 |
5 | 303110031220332 |
6 | 12435242144140 |
7 | 1244234535405 |
oct | 216243522274 |
9 | 54266400036 |
10 | 19101820092 |
11 | 8112530183 |
12 | 38511b2050 |
13 | 1a5559a834 |
14 | cd2cc09ac |
15 | 76be9d82c |
hex | 4728ea4bc |
19101820092 has 48 divisors (see below), whose sum is σ = 47650966272. Its totient is φ = 5934539520.
The previous prime is 19101820063. The next prime is 19101820093. The reversal of 19101820092 is 29002810191.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19101820093) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 433534 + ... + 475557.
It is an arithmetic number, because the mean of its divisors is an integer number (992728464).
Almost surely, 219101820092 is an apocalyptic number.
19101820092 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
19101820092 is an abundant number, since it is smaller than the sum of its proper divisors (28549146180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19101820092 is a wasteful number, since it uses less digits than its factorization.
19101820092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909218 (or 909216 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 33.
Multiplying 19101820092 by its sum of digits (33), we get a palindrome (630360063036).
Subtracting 19101820092 from its reverse (29002810191), we obtain a palindrome (9900990099).
The spelling of 19101820092 in words is "nineteen billion, one hundred one million, eight hundred twenty thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •