Base | Representation |
---|---|
bin | 1111011000000111111011… |
… | …0100101000000101101011 |
3 | 2012212022020012012122202022 |
4 | 3312001332310220011223 |
5 | 4204001234431030323 |
6 | 55543005004255055 |
7 | 3363333112222001 |
oct | 366017664500553 |
9 | 65768205178668 |
10 | 16907119001963 |
11 | 54292a59aa863 |
12 | 1a90867b4148b |
13 | 958446b14bc8 |
14 | 42644799aa71 |
15 | 1e4bd63cb4c8 |
hex | f607ed2816b |
16907119001963 has 2 divisors, whose sum is σ = 16907119001964. Its totient is φ = 16907119001962.
The previous prime is 16907119001947. The next prime is 16907119001987. The reversal of 16907119001963 is 36910091170961.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 16907119001963 - 24 = 16907119001947 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (16907119003963) 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 as a sum of consecutive naturals, namely, 8453559500981 + 8453559500982.
It is an arithmetic number, because the mean of its divisors is an integer number (8453559500982).
Almost surely, 216907119001963 is an apocalyptic number.
16907119001963 is a deficient number, since it is larger than the sum of its proper divisors (1).
16907119001963 is an equidigital number, since it uses as much as digits as its factorization.
16907119001963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 551124, while the sum is 53.
The spelling of 16907119001963 in words is "sixteen trillion, nine hundred seven billion, one hundred nineteen million, one thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •