Base | Representation |
---|---|
bin | 11101111111111011… |
… | …11111101111111111 |
3 | 1112120102112100120112 |
4 | 32333331333233333 |
5 | 230441013231142 |
6 | 11222050540235 |
7 | 1110053234003 |
oct | 167775775777 |
9 | 45512470515 |
10 | 16105602047 |
11 | 6915213217 |
12 | 315589767b |
13 | 169890b852 |
14 | acadc0703 |
15 | 643e05382 |
hex | 3bff7fbff |
16105602047 has 2 divisors, whose sum is σ = 16105602048. Its totient is φ = 16105602046.
The previous prime is 16105602013. The next prime is 16105602049. The reversal of 16105602047 is 74020650161.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16105602047 - 216 = 16105536511 is a prime.
Together with 16105602049, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16105602049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8052801023 + 8052801024.
It is an arithmetic number, because the mean of its divisors is an integer number (8052801024).
Almost surely, 216105602047 is an apocalyptic number.
16105602047 is a deficient number, since it is larger than the sum of its proper divisors (1).
16105602047 is an equidigital number, since it uses as much as digits as its factorization.
16105602047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 16105602047 in words is "sixteen billion, one hundred five million, six hundred two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •