Base | Representation |
---|---|
bin | 1111000010111110111011… |
… | …1000111101011101110011 |
3 | 2011120120202201022121021122 |
4 | 3300233232320331131303 |
5 | 4132023430300404011 |
6 | 55104101454412455 |
7 | 3325154634651605 |
oct | 360575670753563 |
9 | 64516681277248 |
10 | 16543926966131 |
11 | 52a9270522764 |
12 | 1a323a780112b |
13 | 930116148626 |
14 | 412a32091175 |
15 | 1da52b1413db |
hex | f0beee3d773 |
16543926966131 has 8 divisors (see below), whose sum is σ = 16778962668384. Its totient is φ = 16308947448640.
The previous prime is 16543926966121. The next prime is 16543926966221. The reversal of 16543926966131 is 13166962934561.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16543926966131 - 26 = 16543926966067 is a prime.
It is a super-2 number, since 2×165439269661312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16543926966121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13452920 + ... + 14631093.
It is an arithmetic number, because the mean of its divisors is an integer number (2097370333548).
Almost surely, 216543926966131 is an apocalyptic number.
16543926966131 is a deficient number, since it is larger than the sum of its proper divisors (235035702253).
16543926966131 is an equidigital number, since it uses as much as digits as its factorization.
16543926966131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28092381.
The product of its digits is 37791360, while the sum is 62.
The spelling of 16543926966131 in words is "sixteen trillion, five hundred forty-three billion, nine hundred twenty-six million, nine hundred sixty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •