Base | Representation |
---|---|
bin | 11101111010001001… |
… | …01111000000001011 |
3 | 1112110001010222121002 |
4 | 32331010233000023 |
5 | 230341100134221 |
6 | 11213154005215 |
7 | 1105623363254 |
oct | 167504570013 |
9 | 45401128532 |
10 | 16057036811 |
11 | 689a862462 |
12 | 314157680b |
13 | 168b83651a |
14 | ac477bb2b |
15 | 63ea1080b |
hex | 3bd12f00b |
16057036811 has 2 divisors, whose sum is σ = 16057036812. Its totient is φ = 16057036810.
The previous prime is 16057036769. The next prime is 16057036817. The reversal of 16057036811 is 11863075061.
16057036811 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16057036811 - 26 = 16057036747 is a prime.
It is a super-2 number, since 2×160570368112 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (16057036817) 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, 8028518405 + 8028518406.
It is an arithmetic number, because the mean of its divisors is an integer number (8028518406).
Almost surely, 216057036811 is an apocalyptic number.
16057036811 is a deficient number, since it is larger than the sum of its proper divisors (1).
16057036811 is an equidigital number, since it uses as much as digits as its factorization.
16057036811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 38.
The spelling of 16057036811 in words is "sixteen billion, fifty-seven million, thirty-six thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •