Base | Representation |
---|---|
bin | 1110101001110011000011… |
… | …0111101101110110010101 |
3 | 2010001012221011200002011122 |
4 | 3222130300313231312111 |
5 | 4102431311003130011 |
6 | 54133222535213325 |
7 | 3251666413320212 |
oct | 352346067556625 |
9 | 63035834602148 |
10 | 16111242239381 |
11 | 51518152523a3 |
12 | 1982572517245 |
13 | 8cb38c1785b3 |
14 | 3d9b070a8b09 |
15 | 1ce1550a43db |
hex | ea730dedd95 |
16111242239381 has 2 divisors, whose sum is σ = 16111242239382. Its totient is φ = 16111242239380.
The previous prime is 16111242239371. The next prime is 16111242239419. The reversal of 16111242239381 is 18393224211161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9024646851025 + 7086595388356 = 3004105^2 + 2662066^2 .
It is an emirp because it is prime and its reverse (18393224211161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16111242239381 - 226 = 16111175130517 is a prime.
It is a super-2 number, since 2×161112422393812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16111242239371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8055621119690 + 8055621119691.
It is an arithmetic number, because the mean of its divisors is an integer number (8055621119691).
Almost surely, 216111242239381 is an apocalyptic number.
It is an amenable number.
16111242239381 is a deficient number, since it is larger than the sum of its proper divisors (1).
16111242239381 is an equidigital number, since it uses as much as digits as its factorization.
16111242239381 is an evil number, because the sum of its binary digits is even.
The product of its digits is 124416, while the sum is 44.
The spelling of 16111242239381 in words is "sixteen trillion, one hundred eleven billion, two hundred forty-two million, two hundred thirty-nine thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •