Base | Representation |
---|---|
bin | 11101110110110110… |
… | …00100000111110001 |
3 | 1112101010000122021221 |
4 | 32323123010013301 |
5 | 230312002223144 |
6 | 11210324145041 |
7 | 1105136052106 |
oct | 167333040761 |
9 | 45333018257 |
10 | 16029336049 |
11 | 6886162471 |
12 | 3134238181 |
13 | 1685b87c3c |
14 | ac0c0aaad |
15 | 63c38cd84 |
hex | 3bb6c41f1 |
16029336049 has 2 divisors, whose sum is σ = 16029336050. Its totient is φ = 16029336048.
The previous prime is 16029336031. The next prime is 16029336077. The reversal of 16029336049 is 94063392061.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16029332449 + 3600 = 126607^2 + 60^2 .
It is an emirp because it is prime and its reverse (94063392061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16029336049 - 25 = 16029336017 is a prime.
It is a super-2 number, since 2×160293360492 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16029335996 and 16029336014.
It is not a weakly prime, because it can be changed into another prime (16029136049) 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, 8014668024 + 8014668025.
It is an arithmetic number, because the mean of its divisors is an integer number (8014668025).
Almost surely, 216029336049 is an apocalyptic number.
It is an amenable number.
16029336049 is a deficient number, since it is larger than the sum of its proper divisors (1).
16029336049 is an equidigital number, since it uses as much as digits as its factorization.
16029336049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 43.
The spelling of 16029336049 in words is "sixteen billion, twenty-nine million, three hundred thirty-six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •