Base | Representation |
---|---|
bin | 11111000100111101… |
… | …110111111001010101 |
3 | 10012010120021100120011 |
4 | 133010331313321111 |
5 | 1021320021401031 |
6 | 23155112240221 |
7 | 2260631404135 |
oct | 370475677125 |
9 | 105116240504 |
10 | 33369325141 |
11 | 13174128969 |
12 | 65733a0071 |
13 | 31ba43aa09 |
14 | 1887b0cac5 |
15 | d048226b1 |
hex | 7c4f77e55 |
33369325141 has 2 divisors, whose sum is σ = 33369325142. Its totient is φ = 33369325140.
The previous prime is 33369325103. The next prime is 33369325147. The reversal of 33369325141 is 14152396333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33325962916 + 43362225 = 182554^2 + 6585^2 .
It is a cyclic number.
It is not a de Polignac number, because 33369325141 - 217 = 33369194069 is a prime.
It is a super-2 number, since 2×333693251412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33369325094 and 33369325103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33369325147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16684662570 + 16684662571.
It is an arithmetic number, because the mean of its divisors is an integer number (16684662571).
Almost surely, 233369325141 is an apocalyptic number.
It is an amenable number.
33369325141 is a deficient number, since it is larger than the sum of its proper divisors (1).
33369325141 is an equidigital number, since it uses as much as digits as its factorization.
33369325141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 174960, while the sum is 40.
The spelling of 33369325141 in words is "thirty-three billion, three hundred sixty-nine million, three hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •