Base | Representation |
---|---|
bin | 11110011000110010… |
… | …01101000011111011 |
3 | 1120002221210011120101 |
4 | 33030121031003323 |
5 | 231402344423201 |
6 | 11254454540231 |
7 | 1115164142131 |
oct | 171431150373 |
9 | 46087704511 |
10 | 16314061051 |
11 | 6a11953592 |
12 | 31b3667677 |
13 | 16ccb68182 |
14 | b0a965751 |
15 | 657380d01 |
hex | 3cc64d0fb |
16314061051 has 2 divisors, whose sum is σ = 16314061052. Its totient is φ = 16314061050.
The previous prime is 16314061013. The next prime is 16314061079. The reversal of 16314061051 is 15016041361.
It is an a-pointer prime, because the next prime (16314061079) can be obtained adding 16314061051 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16314061051 - 217 = 16313929979 is a prime.
It is a super-2 number, since 2×163140610512 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16314061081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8157030525 + 8157030526.
It is an arithmetic number, because the mean of its divisors is an integer number (8157030526).
Almost surely, 216314061051 is an apocalyptic number.
16314061051 is a deficient number, since it is larger than the sum of its proper divisors (1).
16314061051 is an equidigital number, since it uses as much as digits as its factorization.
16314061051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 28.
The spelling of 16314061051 in words is "sixteen billion, three hundred fourteen million, sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •