Base | Representation |
---|---|
bin | 111101100111101111… |
… | …0111100000111001101 |
3 | 110122120022021011202112 |
4 | 1323033132330013031 |
5 | 4132002440410013 |
6 | 140442551233405 |
7 | 12363155360363 |
oct | 1731736740715 |
9 | 418508234675 |
10 | 132330013133 |
11 | 5113692a51a |
12 | 21791078865 |
13 | c62b827926 |
14 | 6594b0b633 |
15 | 36976b2ba8 |
hex | 1ecf7bc1cd |
132330013133 has 2 divisors, whose sum is σ = 132330013134. Its totient is φ = 132330013132.
The previous prime is 132330013121. The next prime is 132330013139. The reversal of 132330013133 is 331310033231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126663386404 + 5666626729 = 355898^2 + 75277^2 .
It is a cyclic number.
It is not a de Polignac number, because 132330013133 - 210 = 132330012109 is a prime.
It is a super-2 number, since 2×1323300131332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132330013099 and 132330013108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132330013139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66165006566 + 66165006567.
It is an arithmetic number, because the mean of its divisors is an integer number (66165006567).
Almost surely, 2132330013133 is an apocalyptic number.
It is an amenable number.
132330013133 is a deficient number, since it is larger than the sum of its proper divisors (1).
132330013133 is an equidigital number, since it uses as much as digits as its factorization.
132330013133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 132330013133 its reverse (331310033231), we get a palindrome (463640046364).
The spelling of 132330013133 in words is "one hundred thirty-two billion, three hundred thirty million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •