Base | Representation |
---|---|
bin | 100111101100101… |
… | …1000110000010101 |
3 | 10102211111102000122 |
4 | 1033121120300111 |
5 | 10212001230221 |
6 | 340102321325 |
7 | 45003165311 |
oct | 11731306025 |
9 | 3384442018 |
10 | 1332055061 |
11 | 623a01757 |
12 | 312129245 |
13 | 182c7c47c |
14 | c8ca6b41 |
15 | 7be22eab |
hex | 4f658c15 |
1332055061 has 2 divisors, whose sum is σ = 1332055062. Its totient is φ = 1332055060.
The previous prime is 1332055001. The next prime is 1332055063. The reversal of 1332055061 is 1605502331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1211736100 + 120318961 = 34810^2 + 10969^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332055061 - 222 = 1327860757 is a prime.
Together with 1332055063, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1332055061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1332055063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666027530 + 666027531.
It is an arithmetic number, because the mean of its divisors is an integer number (666027531).
Almost surely, 21332055061 is an apocalyptic number.
It is an amenable number.
1332055061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332055061 is an equidigital number, since it uses as much as digits as its factorization.
1332055061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 1332055061 is about 36497.3295050474. The cubic root of 1332055061 is about 1100.2905736492.
Adding to 1332055061 its reverse (1605502331), we get a palindrome (2937557392).
The spelling of 1332055061 in words is "one billion, three hundred thirty-two million, fifty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •