Base | Representation |
---|---|
bin | 11110011000001110… |
… | …00110010101001101 |
3 | 1120002121212001001202 |
4 | 33030013012111031 |
5 | 231400141034033 |
6 | 11254205115245 |
7 | 1115105614004 |
oct | 171407062515 |
9 | 46077761052 |
10 | 16309314893 |
11 | 6a0a201743 |
12 | 31b1b58b25 |
13 | 16cbb95ab1 |
14 | b0a08bc3b |
15 | 656c448e8 |
hex | 3cc1c654d |
16309314893 has 2 divisors, whose sum is σ = 16309314894. Its totient is φ = 16309314892.
The previous prime is 16309314887. The next prime is 16309314979. The reversal of 16309314893 is 39841390361.
16309314893 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8216153449 + 8093161444 = 90643^2 + 89962^2 .
It is an emirp because it is prime and its reverse (39841390361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16309314893 - 24 = 16309314877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16309314823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8154657446 + 8154657447.
It is an arithmetic number, because the mean of its divisors is an integer number (8154657447).
Almost surely, 216309314893 is an apocalyptic number.
It is an amenable number.
16309314893 is a deficient number, since it is larger than the sum of its proper divisors (1).
16309314893 is an equidigital number, since it uses as much as digits as its factorization.
16309314893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 419904, while the sum is 47.
The spelling of 16309314893 in words is "sixteen billion, three hundred nine million, three hundred fourteen thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •