Base | Representation |
---|---|
bin | 1110100101100111001111… |
… | …0110010001001100101111 |
3 | 2002210100100222112120211021 |
4 | 3221121303312101030233 |
5 | 4100242042440124302 |
6 | 54040213143035011 |
7 | 3243543040114555 |
oct | 351316366211457 |
9 | 62710328476737 |
10 | 16039351489327 |
11 | 5124283852881 |
12 | 197064a43ba67 |
13 | 8c46730b873a |
14 | 3d6447315bd5 |
15 | 1cc3489b1437 |
hex | e9673d9132f |
16039351489327 has 2 divisors, whose sum is σ = 16039351489328. Its totient is φ = 16039351489326.
The previous prime is 16039351489279. The next prime is 16039351489333. The reversal of 16039351489327 is 72398415393061.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16039351489327 - 211 = 16039351487279 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16039351489387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8019675744663 + 8019675744664.
It is an arithmetic number, because the mean of its divisors is an integer number (8019675744664).
It is a 1-persistent number, because it is pandigital, but 2⋅16039351489327 = 32078702978654 is not.
Almost surely, 216039351489327 is an apocalyptic number.
16039351489327 is a deficient number, since it is larger than the sum of its proper divisors (1).
16039351489327 is an equidigital number, since it uses as much as digits as its factorization.
16039351489327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29393280, while the sum is 61.
The spelling of 16039351489327 in words is "sixteen trillion, thirty-nine billion, three hundred fifty-one million, four hundred eighty-nine thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •