Base | Representation |
---|---|
bin | 10010001011001001… |
… | …111110001010010000 |
3 | 1212101000000010120000 |
4 | 102023021332022100 |
5 | 304431204003422 |
6 | 12544223450000 |
7 | 1260405435660 |
oct | 221311761220 |
9 | 55330003500 |
10 | 19514516112 |
11 | 8304487873 |
12 | 3947456900 |
13 | 1abcc35b70 |
14 | d31a2c1a0 |
15 | 79331dcac |
hex | 48b27e290 |
19514516112 has 400 divisors, whose sum is σ = 69862945152. Its totient is φ = 5120962560.
The previous prime is 19514516081. The next prime is 19514516113. The reversal of 19514516112 is 21161541591.
It is a happy number.
19514516112 is a `hidden beast` number, since 1 + 95 + 1 + 451 + 6 + 112 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (19514516113) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 39744187 + ... + 39744677.
Almost surely, 219514516112 is an apocalyptic number.
19514516112 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 19514516112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34931472576).
19514516112 is an abundant number, since it is smaller than the sum of its proper divisors (50348429040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19514516112 is a wasteful number, since it uses less digits than its factorization.
19514516112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868 (or 853 counting only the distinct ones).
The product of its digits is 10800, while the sum is 36.
The spelling of 19514516112 in words is "nineteen billion, five hundred fourteen million, five hundred sixteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •