Base | Representation |
---|---|
bin | 11110110101001010… |
… | …001010101100010001 |
3 | 10011110002020011002002 |
4 | 132311022022230101 |
5 | 1020244123044101 |
6 | 23112520003345 |
7 | 2251231212143 |
oct | 366512125421 |
9 | 104402204062 |
10 | 33104112401 |
11 | 13048454688 |
12 | 64ba600555 |
13 | 31774ccbb9 |
14 | 18607d2c93 |
15 | cdb3d5d6b |
hex | 7b528ab11 |
33104112401 has 2 divisors, whose sum is σ = 33104112402. Its totient is φ = 33104112400.
The previous prime is 33104112361. The next prime is 33104112403. The reversal of 33104112401 is 10421140133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27286084225 + 5818028176 = 165185^2 + 76276^2 .
It is an emirp because it is prime and its reverse (10421140133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 33104112401 - 210 = 33104111377 is a prime.
Together with 33104112403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (33104112403) 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, 16552056200 + 16552056201.
It is an arithmetic number, because the mean of its divisors is an integer number (16552056201).
Almost surely, 233104112401 is an apocalyptic number.
It is an amenable number.
33104112401 is a deficient number, since it is larger than the sum of its proper divisors (1).
33104112401 is an equidigital number, since it uses as much as digits as its factorization.
33104112401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 33104112401 its reverse (10421140133), we get a palindrome (43525252534).
The spelling of 33104112401 in words is "thirty-three billion, one hundred four million, one hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •