Base | Representation |
---|---|
bin | 11110011010101110… |
… | …10110100111101101 |
3 | 1120011002102220002211 |
4 | 33031113112213231 |
5 | 231421032300013 |
6 | 11300240050421 |
7 | 1115452465663 |
oct | 171527264755 |
9 | 46132386084 |
10 | 16330353133 |
11 | 6a20071016 |
12 | 31b9003a11 |
13 | 1703350963 |
14 | b0cba6c33 |
15 | 6589ed23d |
hex | 3cd5d69ed |
16330353133 has 2 divisors, whose sum is σ = 16330353134. Its totient is φ = 16330353132.
The previous prime is 16330353131. The next prime is 16330353157. The reversal of 16330353133 is 33135303361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13247549604 + 3082803529 = 115098^2 + 55523^2 .
It is an emirp because it is prime and its reverse (33135303361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16330353133 - 21 = 16330353131 is a prime.
Together with 16330353131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 16330353095 and 16330353104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16330353131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8165176566 + 8165176567.
It is an arithmetic number, because the mean of its divisors is an integer number (8165176567).
Almost surely, 216330353133 is an apocalyptic number.
It is an amenable number.
16330353133 is a deficient number, since it is larger than the sum of its proper divisors (1).
16330353133 is an equidigital number, since it uses as much as digits as its factorization.
16330353133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21870, while the sum is 31.
Adding to 16330353133 its reverse (33135303361), we get a palindrome (49465656494).
The spelling of 16330353133 in words is "sixteen billion, three hundred thirty million, three hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •