Base | Representation |
---|---|
bin | 10001101110000010… |
… | …100001000000000000 |
3 | 1211002221211002011022 |
4 | 101232002201000000 |
5 | 302431130204100 |
6 | 12423533405012 |
7 | 1242324344030 |
oct | 215602410000 |
9 | 54087732138 |
10 | 19026022400 |
11 | 808376a260 |
12 | 382b939768 |
13 | 1a4297c128 |
14 | cc6bcd8c0 |
15 | 7654c9e85 |
hex | 46e0a1000 |
19026022400 has 624 divisors, whose sum is σ = 62403624960. Its totient is φ = 5573836800.
The previous prime is 19026022399. The next prime is 19026022403. The reversal of 19026022400 is 422062091.
It is a self number, because there is not a number n which added to its sum of digits gives 19026022400.
It is not an unprimeable number, because it can be changed into a prime (19026022403) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 149811137 + ... + 149811263.
Almost surely, 219026022400 is an apocalyptic number.
19026022400 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 19026022400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31201812480).
19026022400 is an abundant number, since it is smaller than the sum of its proper divisors (43377602560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19026022400 is a wasteful number, since it uses less digits than its factorization.
19026022400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198 (or 171 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 19026022400 its reverse (422062091), we get a palindrome (19448084491).
The spelling of 19026022400 in words is "nineteen billion, twenty-six million, twenty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •