Base | Representation |
---|---|
bin | 11110000000100110… |
… | …11011010111111001 |
3 | 1112120211002210020220 |
4 | 33000103123113321 |
5 | 230443433021332 |
6 | 11222411210253 |
7 | 1110152053341 |
oct | 170023332771 |
9 | 45524083226 |
10 | 16111220217 |
11 | 6918400234 |
12 | 3157746989 |
13 | 1699b27b01 |
14 | acba43d21 |
15 | 644664d2c |
hex | 3c04db5f9 |
16111220217 has 4 divisors (see below), whose sum is σ = 21481626960. Its totient is φ = 10740813476.
The previous prime is 16111220197. The next prime is 16111220227. The reversal of 16111220217 is 71202211161.
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 16111220217 - 27 = 16111220089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (16111220227) 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 3 ways as a sum of consecutive naturals, for example, 2685203367 + ... + 2685203372.
It is an arithmetic number, because the mean of its divisors is an integer number (5370406740).
Almost surely, 216111220217 is an apocalyptic number.
It is an amenable number.
16111220217 is a deficient number, since it is larger than the sum of its proper divisors (5370406743).
16111220217 is an equidigital number, since it uses as much as digits as its factorization.
16111220217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5370406742.
The product of its (nonzero) digits is 336, while the sum is 24.
Adding to 16111220217 its reverse (71202211161), we get a palindrome (87313431378).
It can be divided in two parts, 16111 and 220217, that added together give a triangular number (236328 = T687).
The spelling of 16111220217 in words is "sixteen billion, one hundred eleven million, two hundred twenty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •