Base | Representation |
---|---|
bin | 1000101011000111011100… |
… | …10100110100000101011111 |
3 | 2111112102102200120201120021 |
4 | 10111203232110310011133 |
5 | 10000000320211242441 |
6 | 104322152035533011 |
7 | 4006011623254414 |
oct | 425435624640537 |
9 | 74472380521507 |
10 | 19073653227871 |
11 | 60940aaaa8400 |
12 | 2180727a5a167 |
13 | a8483a28b348 |
14 | 49d253ab410b |
15 | 2312398083d1 |
hex | 1158ee53415f |
19073653227871 has 24 divisors (see below), whose sum is σ = 21877874589312. Its totient is φ = 16584961654800.
The previous prime is 19073653227851. The next prime is 19073653227907. The reversal of 19073653227871 is 17872235637091.
It is not a de Polignac number, because 19073653227871 - 213 = 19073653219679 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19073653227851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 59650000 + ... + 59968906.
It is an arithmetic number, because the mean of its divisors is an integer number (911578107888).
Almost surely, 219073653227871 is an apocalyptic number.
19073653227871 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
19073653227871 is a deficient number, since it is larger than the sum of its proper divisors (2804221361441).
19073653227871 is a wasteful number, since it uses less digits than its factorization.
19073653227871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340443 (or 340432 counting only the distinct ones).
The product of its (nonzero) digits is 26671680, while the sum is 61.
The spelling of 19073653227871 in words is "nineteen trillion, seventy-three billion, six hundred fifty-three million, two hundred twenty-seven thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •