Base | Representation |
---|---|
bin | 11101111000111100… |
… | …00000011001100101 |
3 | 1112102100001012011211 |
4 | 32330132000121211 |
5 | 230331000300303 |
6 | 11212152231421 |
7 | 1105441160455 |
oct | 167436003145 |
9 | 45370035154 |
10 | 16046884453 |
11 | 6895058886 |
12 | 313a09b571 |
13 | 16896c0502 |
14 | ac3297d65 |
15 | 63dba766d |
hex | 3bc780665 |
16046884453 has 2 divisors, whose sum is σ = 16046884454. Its totient is φ = 16046884452.
The previous prime is 16046884433. The next prime is 16046884457. The reversal of 16046884453 is 35448864061.
16046884453 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 can be written as a sum of positive squares in only one way, i.e., 11278015204 + 4768869249 = 106198^2 + 69057^2 .
It is a cyclic number.
It is not a de Polignac number, because 16046884453 - 233 = 7456949861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16046884397 and 16046884406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16046884457) 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, 8023442226 + 8023442227.
It is an arithmetic number, because the mean of its divisors is an integer number (8023442227).
Almost surely, 216046884453 is an apocalyptic number.
It is an amenable number.
16046884453 is a deficient number, since it is larger than the sum of its proper divisors (1).
16046884453 is an equidigital number, since it uses as much as digits as its factorization.
16046884453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2211840, while the sum is 49.
The spelling of 16046884453 in words is "sixteen billion, forty-six million, eight hundred eighty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •