Base | Representation |
---|---|
bin | 1000101101110100000010… |
… | …10011000001000000000001 |
3 | 2111212021121022220010200221 |
4 | 10112322001103001000001 |
5 | 10003010102202223244 |
6 | 104432514403143041 |
7 | 4015502053123051 |
oct | 426720123010001 |
9 | 74767538803627 |
10 | 19166313320449 |
11 | 611a42a228409 |
12 | 2196687674a81 |
13 | a904b62336a9 |
14 | 4a3923db7561 |
15 | 23385e485784 |
hex | 116e814c1001 |
19166313320449 has 4 divisors (see below), whose sum is σ = 19187921340864. Its totient is φ = 19144705300036.
The previous prime is 19166313320387. The next prime is 19166313320471. The reversal of 19166313320449 is 94402331366191.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 19166313320449 - 213 = 19166313312257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19166313320396 and 19166313320405.
It is not an unprimeable number, because it can be changed into a prime (19166313360449) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10804008877 + ... + 10804010650.
It is an arithmetic number, because the mean of its divisors is an integer number (4796980335216).
Almost surely, 219166313320449 is an apocalyptic number.
It is an amenable number.
19166313320449 is a deficient number, since it is larger than the sum of its proper divisors (21608020415).
19166313320449 is an equidigital number, since it uses as much as digits as its factorization.
19166313320449 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21608020414.
The product of its (nonzero) digits is 2519424, while the sum is 52.
The spelling of 19166313320449 in words is "nineteen trillion, one hundred sixty-six billion, three hundred thirteen million, three hundred twenty thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •