Base | Representation |
---|---|
bin | 10011111100001… |
… | …111111100001001 |
3 | 212022112110110101 |
4 | 103330033330021 |
5 | 1141121423113 |
6 | 53110445401 |
7 | 11201502412 |
oct | 2374177411 |
9 | 768473411 |
10 | 334561033 |
11 | 16193a724 |
12 | 94063861 |
13 | 5440bb11 |
14 | 3260c809 |
15 | 1e5892dd |
hex | 13f0ff09 |
334561033 has 2 divisors, whose sum is σ = 334561034. Its totient is φ = 334561032.
The previous prime is 334561009. The next prime is 334561039. The reversal of 334561033 is 330165433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 239537529 + 95023504 = 15477^2 + 9748^2 .
It is a cyclic number.
It is not a de Polignac number, because 334561033 - 25 = 334561001 is a prime.
It is a super-3 number, since 3×3345610333 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 334560992 and 334561010.
It is not a weakly prime, because it can be changed into another prime (334561039) 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, 167280516 + 167280517.
It is an arithmetic number, because the mean of its divisors is an integer number (167280517).
Almost surely, 2334561033 is an apocalyptic number.
It is an amenable number.
334561033 is a deficient number, since it is larger than the sum of its proper divisors (1).
334561033 is an equidigital number, since it uses as much as digits as its factorization.
334561033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 28.
The square root of 334561033 is about 18291.0096222160. The cubic root of 334561033 is about 694.2114708228.
The spelling of 334561033 in words is "three hundred thirty-four million, five hundred sixty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •