Base | Representation |
---|---|
bin | 111111011011… |
… | …0101011111101 |
3 | 2022120111002212 |
4 | 1332312223331 |
5 | 32003113031 |
6 | 3144430205 |
7 | 552440564 |
oct | 176665375 |
9 | 68514085 |
10 | 33254141 |
11 | 17853368 |
12 | b178365 |
13 | 6b7420b |
14 | 45b8bdb |
15 | 2dbd12b |
hex | 1fb6afd |
33254141 has 2 divisors, whose sum is σ = 33254142. Its totient is φ = 33254140.
The previous prime is 33254131. The next prime is 33254153. The reversal of 33254141 is 14145233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24462916 + 8791225 = 4946^2 + 2965^2 .
It is an emirp because it is prime and its reverse (14145233) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33254141 is a prime.
It is a super-2 number, since 2×332541412 = 2211675787295762, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33254131) 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, 16627070 + 16627071.
It is an arithmetic number, because the mean of its divisors is an integer number (16627071).
Almost surely, 233254141 is an apocalyptic number.
It is an amenable number.
33254141 is a deficient number, since it is larger than the sum of its proper divisors (1).
33254141 is an equidigital number, since it uses as much as digits as its factorization.
33254141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1440, while the sum is 23.
The square root of 33254141 is about 5766.6403563947. The cubic root of 33254141 is about 321.5747282446.
Adding to 33254141 its reverse (14145233), we get a palindrome (47399374).
The spelling of 33254141 in words is "thirty-three million, two hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •