Base | Representation |
---|---|
bin | 1000110101011000111000… |
… | …01010011101111111111101 |
3 | 2112210011110211020111010011 |
4 | 10122230130022131333331 |
5 | 10021241144023224143 |
6 | 105152243343343221 |
7 | 4043345331642166 |
oct | 432543412357775 |
9 | 75704424214104 |
10 | 19426609586173 |
11 | 620a86272a479 |
12 | 22190102b1b11 |
13 | aabbc94a0bba |
14 | 4b237802c76d |
15 | 23a4e617ee9d |
hex | 11ab1c29dffd |
19426609586173 has 16 divisors (see below), whose sum is σ = 19969193185920. Its totient is φ = 18884952709056.
The previous prime is 19426609586161. The next prime is 19426609586221. The reversal of 19426609586173 is 37168590662491.
It is a cyclic number.
It is not a de Polignac number, because 19426609586173 - 229 = 19426072715261 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19426609586099 and 19426609586108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19426609526173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 517927486 + ... + 517964992.
It is an arithmetic number, because the mean of its divisors is an integer number (1248074574120).
It is a 1-persistent number, because it is pandigital, but 2⋅19426609586173 = 38853219172346 is not.
Almost surely, 219426609586173 is an apocalyptic number.
It is an amenable number.
19426609586173 is a deficient number, since it is larger than the sum of its proper divisors (542583599747).
19426609586173 is a wasteful number, since it uses less digits than its factorization.
19426609586173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49476.
The product of its (nonzero) digits is 117573120, while the sum is 67.
The spelling of 19426609586173 in words is "nineteen trillion, four hundred twenty-six billion, six hundred nine million, five hundred eighty-six thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •