Base | Representation |
---|---|
bin | 100111101100110… |
… | …1110111101110001 |
3 | 10102211200000210222 |
4 | 1033121232331301 |
5 | 10212012133113 |
6 | 340104302425 |
7 | 45004024451 |
oct | 11731567561 |
9 | 3384600728 |
10 | 1332146033 |
11 | 623a64039 |
12 | 312171a15 |
13 | 182cb19ba |
14 | c8ccbd61 |
15 | 7be3ee08 |
hex | 4f66ef71 |
1332146033 has 2 divisors, whose sum is σ = 1332146034. Its totient is φ = 1332146032.
The previous prime is 1332146029. The next prime is 1332146077. The reversal of 1332146033 is 3306412331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 973876849 + 358269184 = 31207^2 + 18928^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332146033 - 22 = 1332146029 is a prime.
It is a super-2 number, since 2×13321460332 = 3549226106475274178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1332145993 and 1332146011.
It is not a weakly prime, because it can be changed into another prime (1332146003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666073016 + 666073017.
It is an arithmetic number, because the mean of its divisors is an integer number (666073017).
Almost surely, 21332146033 is an apocalyptic number.
It is an amenable number.
1332146033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332146033 is an equidigital number, since it uses as much as digits as its factorization.
1332146033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
The square root of 1332146033 is about 36498.5757667337. The cubic root of 1332146033 is about 1100.3156210010.
Adding to 1332146033 its reverse (3306412331), we get a palindrome (4638558364).
The spelling of 1332146033 in words is "one billion, three hundred thirty-two million, one hundred forty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •