Base | Representation |
---|---|
bin | 10001110011000011… |
… | …011111011010010000 |
3 | 1211022211010220220000 |
4 | 101303003133122100 |
5 | 303114200222422 |
6 | 12440141050000 |
7 | 1244365500114 |
oct | 216303373220 |
9 | 54284126800 |
10 | 19110164112 |
11 | 811720a166 |
12 | 3853b56900 |
13 | 1a5722c720 |
14 | cd4053744 |
15 | 76ca9acac |
hex | 4730df690 |
19110164112 has 200 divisors, whose sum is σ = 59815546560. Its totient is φ = 5855328000.
The previous prime is 19110164057. The next prime is 19110164131. The reversal of 19110164112 is 21146101191.
19110164112 is a `hidden beast` number, since 1 + 9 + 1 + 1 + 0 + 1 + 641 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 39 ways as a sum of consecutive naturals, for example, 4226589 + ... + 4231107.
Almost surely, 219110164112 is an apocalyptic number.
19110164112 is a gapful number since it is divisible by the number (12) 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 19110164112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29907773280).
19110164112 is an abundant number, since it is smaller than the sum of its proper divisors (40705382448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19110164112 is a wasteful number, since it uses less digits than its factorization.
19110164112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4803 (or 4788 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 27.
The spelling of 19110164112 in words is "nineteen billion, one hundred ten million, one hundred sixty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •