Base | Representation |
---|---|
bin | 1000101101110100000010… |
… | …10011000000111111010101 |
3 | 2111212021121022220010122022 |
4 | 10112322001103000333111 |
5 | 10003010102202223110 |
6 | 104432514403142525 |
7 | 4015502053122656 |
oct | 426720123007725 |
9 | 74767538803568 |
10 | 19166313320405 |
11 | 611a42a228379 |
12 | 2196687674a45 |
13 | a904b6233674 |
14 | 4a3923db752d |
15 | 23385e485755 |
hex | 116e814c0fd5 |
19166313320405 has 4 divisors (see below), whose sum is σ = 22999575984492. Its totient is φ = 15333050656320.
The previous prime is 19166313320387. The next prime is 19166313320471. The reversal of 19166313320405 is 50402331366191.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7275243874756 + 11891069445649 = 2697266^2 + 3448343^2 .
It is not a de Polignac number, because 19166313320405 - 242 = 14768266809301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1916631332036 + ... + 1916631332045.
It is an arithmetic number, because the mean of its divisors is an integer number (5749893996123).
Almost surely, 219166313320405 is an apocalyptic number.
It is an amenable number.
19166313320405 is a deficient number, since it is larger than the sum of its proper divisors (3833262664087).
19166313320405 is an equidigital number, since it uses as much as digits as its factorization.
19166313320405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3833262664086.
The product of its (nonzero) digits is 349920, while the sum is 44.
Adding to 19166313320405 its reverse (50402331366191), we get a palindrome (69568644686596).
The spelling of 19166313320405 in words is "nineteen trillion, one hundred sixty-six billion, three hundred thirteen million, three hundred twenty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •