Base | Representation |
---|---|
bin | 1110101001110010100100… |
… | …0011011110100110101101 |
3 | 2010001012121000220202112112 |
4 | 3222130221003132212231 |
5 | 4102431023420324231 |
6 | 54133201532413405 |
7 | 3251663231563106 |
oct | 352345103364655 |
9 | 63035530822475 |
10 | 16111111104941 |
11 | 5151758226126 |
12 | 1982536617265 |
13 | 8cb36ac53658 |
14 | 3d9ad38d13ad |
15 | 1ce1487ee92b |
hex | ea7290de9ad |
16111111104941 has 2 divisors, whose sum is σ = 16111111104942. Its totient is φ = 16111111104940.
The previous prime is 16111111104863. The next prime is 16111111105021. The reversal of 16111111104941 is 14940111111161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12355154700100 + 3755956404841 = 3514990^2 + 1938029^2 .
It is a cyclic number.
It is not a de Polignac number, because 16111111104941 - 214 = 16111111088557 is a prime.
It is a super-2 number, since 2×161111111049412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16111111104898 and 16111111104907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16111111104241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8055555552470 + 8055555552471.
It is an arithmetic number, because the mean of its divisors is an integer number (8055555552471).
Almost surely, 216111111104941 is an apocalyptic number.
It is an amenable number.
16111111104941 is a deficient number, since it is larger than the sum of its proper divisors (1).
16111111104941 is an equidigital number, since it uses as much as digits as its factorization.
16111111104941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 32.
The spelling of 16111111104941 in words is "sixteen trillion, one hundred eleven billion, one hundred eleven million, one hundred four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •