Base | Representation |
---|---|
bin | 1000101101000110101101… |
… | …01011111000010010111001 |
3 | 2111202221210020010010201212 |
4 | 10112203112223320102321 |
5 | 10002110231340113402 |
6 | 104413411420052505 |
7 | 4013651004133505 |
oct | 426432653702271 |
9 | 74687706103655 |
10 | 19141976097977 |
11 | 6110080527a07 |
12 | 2191a15094135 |
13 | a8b108106035 |
14 | 4a2695a79305 |
15 | 232dd7a81952 |
hex | 1168d6af84b9 |
19141976097977 has 8 divisors (see below), whose sum is σ = 19556951894400. Its totient is φ = 18727321122864.
The previous prime is 19141976097953. The next prime is 19141976097989. The reversal of 19141976097977 is 77979067914191.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 19141976097977 - 218 = 19141975835833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19141976097898 and 19141976097907.
It is not an unprimeable number, because it can be changed into a prime (19141976097917) 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 7 ways as a sum of consecutive naturals, for example, 80084702 + ... + 80323367.
It is an arithmetic number, because the mean of its divisors is an integer number (2444618986800).
Almost surely, 219141976097977 is an apocalyptic number.
It is an amenable number.
19141976097977 is a deficient number, since it is larger than the sum of its proper divisors (414975796423).
19141976097977 is a wasteful number, since it uses less digits than its factorization.
19141976097977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160410655.
The product of its (nonzero) digits is 378071064, while the sum is 77.
The spelling of 19141976097977 in words is "nineteen trillion, one hundred forty-one billion, nine hundred seventy-six million, ninety-seven thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •