Base | Representation |
---|---|
bin | 1111001011100101001010… |
… | …1111100011101111111001 |
3 | 2012002201000110201121012122 |
4 | 3302321102233203233321 |
5 | 4141433430031024121 |
6 | 55300010211051025 |
7 | 3341634115324256 |
oct | 362712257435771 |
9 | 65081013647178 |
10 | 16691631111161 |
11 | 5355976681006 |
12 | 1a56b495a0a75 |
13 | 941024b74506 |
14 | 419c4497242d |
15 | 1de2c33bc5ab |
hex | f2e52be3bf9 |
16691631111161 has 4 divisors (see below), whose sum is σ = 16770738367824. Its totient is φ = 16612523854500.
The previous prime is 16691631111049. The next prime is 16691631111203. The reversal of 16691631111161 is 16111113619661.
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 16691631111161 - 210 = 16691631110137 is a prime.
It is a super-2 number, since 2×166916311111612 (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 (16691631111461) 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, 39553628015 + ... + 39553628436.
It is an arithmetic number, because the mean of its divisors is an integer number (4192684591956).
Almost surely, 216691631111161 is an apocalyptic number.
It is an amenable number.
16691631111161 is a deficient number, since it is larger than the sum of its proper divisors (79107256663).
16691631111161 is an equidigital number, since it uses as much as digits as its factorization.
16691631111161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79107256662.
The product of its digits is 34992, while the sum is 44.
The spelling of 16691631111161 in words is "sixteen trillion, six hundred ninety-one billion, six hundred thirty-one million, one hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •