Base | Representation |
---|---|
bin | 1110100011111110000010… |
… | …0101101001100101100011 |
3 | 2002200122110212020001200000 |
4 | 3220333200211221211203 |
5 | 4044311223414000433 |
6 | 54015223005031043 |
7 | 3241523154433551 |
oct | 350774045514543 |
9 | 62618425201600 |
10 | 16011111078243 |
11 | 5113301881a66 |
12 | 1967088855483 |
13 | 8c1ac2434a18 |
14 | 3d4d28864bd1 |
15 | 1cb7445ac113 |
hex | e8fe0969963 |
16011111078243 has 12 divisors (see below), whose sum is σ = 23983721944728. Its totient is φ = 10674074052000.
The previous prime is 16011111078197. The next prime is 16011111078283. The reversal of 16011111078243 is 34287011111061.
16011111078243 is a `hidden beast` number, since 1 + 601 + 1 + 1 + 1 + 1 + 0 + 7 + 8 + 2 + 43 = 666.
It is not a de Polignac number, because 16011111078243 - 222 = 16011106883939 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16011111078198 and 16011111078207.
It is not an unprimeable number, because it can be changed into a prime (16011111078283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32944672758 + ... + 32944673243.
It is an arithmetic number, because the mean of its divisors is an integer number (1998643495394).
Almost surely, 216011111078243 is an apocalyptic number.
16011111078243 is a deficient number, since it is larger than the sum of its proper divisors (7972610866485).
16011111078243 is an frugal number, since it uses more digits than its factorization.
16011111078243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65889346016 (or 65889346004 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 36.
The spelling of 16011111078243 in words is "sixteen trillion, eleven billion, one hundred eleven million, seventy-eight thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •