Base | Representation |
---|---|
bin | 1110101001010000110110… |
… | …1101001001001001000111 |
3 | 2010000100020102001101111011 |
4 | 3222110031231021021013 |
5 | 4102304010424033224 |
6 | 54125104010023051 |
7 | 3251223054350251 |
oct | 352241555111107 |
9 | 63010212041434 |
10 | 16102062330439 |
11 | 5148934450998 |
12 | 1980830117a87 |
13 | 8ca558356a07 |
14 | 3d94b5c20cd1 |
15 | 1cdcb91db394 |
hex | ea50db49247 |
16102062330439 has 2 divisors, whose sum is σ = 16102062330440. Its totient is φ = 16102062330438.
The previous prime is 16102062330401. The next prime is 16102062330457. The reversal of 16102062330439 is 93403326020161.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16102062330439 - 27 = 16102062330311 is a prime.
It is a super-2 number, since 2×161020623304392 (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 (16102062370439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8051031165219 + 8051031165220.
It is an arithmetic number, because the mean of its divisors is an integer number (8051031165220).
Almost surely, 216102062330439 is an apocalyptic number.
16102062330439 is a deficient number, since it is larger than the sum of its proper divisors (1).
16102062330439 is an equidigital number, since it uses as much as digits as its factorization.
16102062330439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 40.
The spelling of 16102062330439 in words is "sixteen trillion, one hundred two billion, sixty-two million, three hundred thirty thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •