Base | Representation |
---|---|
bin | 10001110100111011… |
… | …110000001111100101 |
3 | 1211102000110121202010 |
4 | 101310323300033211 |
5 | 303200233042331 |
6 | 12443224504433 |
7 | 1245230453244 |
oct | 216473601745 |
9 | 54360417663 |
10 | 19141690341 |
11 | 8132a922a4 |
12 | 386261b119 |
13 | 1a6091a2b7 |
14 | cd82dc95b |
15 | 770726e46 |
hex | 474ef03e5 |
19141690341 has 8 divisors (see below), whose sum is σ = 25628156224. Its totient is φ = 12708175680.
The previous prime is 19141690339. The next prime is 19141690369. The reversal of 19141690341 is 14309614191.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 19141690341 - 21 = 19141690339 is a prime.
It is a super-2 number, since 2×191416903412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 19141690341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19141690301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13236961 + ... + 13238406.
It is an arithmetic number, because the mean of its divisors is an integer number (3203519528).
Almost surely, 219141690341 is an apocalyptic number.
It is an amenable number.
19141690341 is a deficient number, since it is larger than the sum of its proper divisors (6486465883).
19141690341 is a wasteful number, since it uses less digits than its factorization.
19141690341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26475611.
The product of its (nonzero) digits is 23328, while the sum is 39.
The spelling of 19141690341 in words is "nineteen billion, one hundred forty-one million, six hundred ninety thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •