Base | Representation |
---|---|
bin | 10001111111000101… |
… | …110101011001000000 |
3 | 1211211220010120202001 |
4 | 101333011311121000 |
5 | 304022344330044 |
6 | 12512153233344 |
7 | 1252400120122 |
oct | 217705653100 |
9 | 54756116661 |
10 | 19312105024 |
11 | 82101a8383 |
12 | 38ab702854 |
13 | 1a8a0162a4 |
14 | d12bbd212 |
15 | 78068a2d4 |
hex | 47f175640 |
19312105024 has 63 divisors (see below), whose sum is σ = 39755860417. Its totient is φ = 9307520768.
The previous prime is 19312104989. The next prime is 19312105051. The reversal of 19312105024 is 42050121391.
The square root of 19312105024 is 138968.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10126799424 + 9185305600 = 100632^2 + 95840^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19312104983 and 19312105001.
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 8 ways as a sum of consecutive naturals, for example, 32240277 + ... + 32240875.
Almost surely, 219312105024 is an apocalyptic number.
19312105024 is the 138968-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19312105024
19312105024 is an abundant number, since it is smaller than the sum of its proper divisors (20443755393).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19312105024 is an frugal number, since it uses more digits than its factorization.
19312105024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268 (or 630 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 28.
The spelling of 19312105024 in words is "nineteen billion, three hundred twelve million, one hundred five thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •