Base | Representation |
---|---|
bin | 1100100101001000111… |
… | …0001001001100000001 |
3 | 202122212022121000122110 |
4 | 3021102032021030001 |
5 | 12020112204213121 |
6 | 243142052525533 |
7 | 21420564011133 |
oct | 3112216111401 |
9 | 678768530573 |
10 | 216127804161 |
11 | 83728569175 |
12 | 35a789208a9 |
13 | 174c4702569 |
14 | a664001053 |
15 | 594e2b2d76 |
hex | 3252389301 |
216127804161 has 4 divisors (see below), whose sum is σ = 288170405552. Its totient is φ = 144085202772.
The previous prime is 216127804159. The next prime is 216127804163. The reversal of 216127804161 is 161408721612.
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 an interprime number because it is at equal distance from previous prime (216127804159) and next prime (216127804163).
It is not a de Polignac number, because 216127804161 - 21 = 216127804159 is a prime.
It is a super-2 number, since 2×2161278041612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (216127804163) 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, 36021300691 + ... + 36021300696.
It is an arithmetic number, because the mean of its divisors is an integer number (72042601388).
Almost surely, 2216127804161 is an apocalyptic number.
It is an amenable number.
216127804161 is a deficient number, since it is larger than the sum of its proper divisors (72042601391).
216127804161 is an equidigital number, since it uses as much as digits as its factorization.
216127804161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72042601390.
The product of its (nonzero) digits is 32256, while the sum is 39.
The spelling of 216127804161 in words is "two hundred sixteen billion, one hundred twenty-seven million, eight hundred four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •