Base | Representation |
---|---|
bin | 10001111111101100… |
… | …000000100000010000 |
3 | 1211212120221222202101 |
4 | 101333230000200100 |
5 | 304032430041031 |
6 | 12513151530144 |
7 | 1252551146044 |
oct | 217754004020 |
9 | 54776858671 |
10 | 19322112016 |
11 | 8215912819 |
12 | 38b2b29954 |
13 | 1a8c10b09c |
14 | d14266024 |
15 | 7814b5361 |
hex | 47fb00810 |
19322112016 has 135 divisors (see below), whose sum is σ = 41529991743. Its totient is φ = 8707210560.
The previous prime is 19322111999. The next prime is 19322112031. The reversal of 19322112016 is 61021122391.
The square root of 19322112016 is 139004.
It is a perfect power (a square), and thus also a powerful number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 327493395 + ... + 327493453.
Almost surely, 219322112016 is an apocalyptic number.
19322112016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
19322112016 is the 139004-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19322112016
19322112016 is an abundant number, since it is smaller than the sum of its proper divisors (22207879727).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19322112016 is an equidigital number, since it uses as much as digits as its factorization.
19322112016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 28.
Multiplying 19322112016 by its product of nonzero digits (1296), we get a square (25041457172736 = 50041442).
The spelling of 19322112016 in words is "nineteen billion, three hundred twenty-two million, one hundred twelve thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •