Base | Representation |
---|---|
bin | 10010010100110100… |
… | …101010000110000010 |
3 | 1212210022011222110212 |
4 | 102110310222012002 |
5 | 310244213413213 |
6 | 13012255554122 |
7 | 1264415125250 |
oct | 222464520602 |
9 | 55708158425 |
10 | 19676701058 |
11 | 8387a91813 |
12 | 399182b942 |
13 | 1b1770cca1 |
14 | d493a95d0 |
15 | 7a26a89a8 |
hex | 494d2a182 |
19676701058 has 64 divisors (see below), whose sum is σ = 35573465088. Its totient is φ = 7987351680.
The previous prime is 19676701049. The next prime is 19676701061. The reversal of 19676701058 is 85010767691.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 19676700997 and 19676701015.
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 31 ways as a sum of consecutive naturals, for example, 3423335 + ... + 3429077.
It is an arithmetic number, because the mean of its divisors is an integer number (555835392).
Almost surely, 219676701058 is an apocalyptic number.
19676701058 is a deficient number, since it is larger than the sum of its proper divisors (15896764030).
19676701058 is a wasteful number, since it uses less digits than its factorization.
19676701058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5967.
The product of its (nonzero) digits is 635040, while the sum is 50.
The spelling of 19676701058 in words is "nineteen billion, six hundred seventy-six million, seven hundred one thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •