Base | Representation |
---|---|
bin | 10001110100000001… |
… | …110101100111000000 |
3 | 1211100221220021110000 |
4 | 101310001311213000 |
5 | 303132341223333 |
6 | 12441523240000 |
7 | 1244654430621 |
oct | 216401654700 |
9 | 54327807400 |
10 | 19126507968 |
11 | 8125462587 |
12 | 3859519000 |
13 | 1a5a732949 |
14 | cd62a9a48 |
15 | 76e228713 |
hex | 4740759c0 |
19126507968 has 280 divisors, whose sum is σ = 61977446784. Its totient is φ = 5806080000.
The previous prime is 19126507963. The next prime is 19126507993. The reversal of 19126507968 is 86970562191.
19126507968 is a `hidden beast` number, since 1 + 9 + 126 + 507 + 9 + 6 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19126507963) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2728468 + ... + 2735468.
Almost surely, 219126507968 is an apocalyptic number.
19126507968 is a gapful number since it is divisible by the number (18) 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 19126507968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30988723392).
19126507968 is an abundant number, since it is smaller than the sum of its proper divisors (42850938816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19126507968 is a wasteful number, since it uses less digits than its factorization.
19126507968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7073 (or 7054 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 54.
The spelling of 19126507968 in words is "nineteen billion, one hundred twenty-six million, five hundred seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •