Base | Representation |
---|---|
bin | 1111101111010… |
… | …01001010000101 |
3 | 100012102200000101 |
4 | 13313221022011 |
5 | 232244331023 |
6 | 21033444101 |
7 | 3162132256 |
oct | 767511205 |
9 | 305380011 |
10 | 132027013 |
11 | 68586938 |
12 | 38270631 |
13 | 214782c1 |
14 | 1376ab2d |
15 | b8ce1ad |
hex | 7de9285 |
132027013 has 8 divisors (see below), whose sum is σ = 133693560. Its totient is φ = 130368960.
The previous prime is 132026987. The next prime is 132027017. The reversal of 132027013 is 310720231.
It can be written as a sum of positive squares in 4 ways, for example, as 25070049 + 106956964 = 5007^2 + 10342^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132027013 is a prime.
It is a super-2 number, since 2×1320270132 = 34862264323404338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132027017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32643 + ... + 36463.
It is an arithmetic number, because the mean of its divisors is an integer number (16711695).
Almost surely, 2132027013 is an apocalyptic number.
It is an amenable number.
132027013 is a deficient number, since it is larger than the sum of its proper divisors (1666547).
132027013 is a wasteful number, since it uses less digits than its factorization.
132027013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4247.
The product of its (nonzero) digits is 252, while the sum is 19.
The square root of 132027013 is about 11490.3008228680. The cubic root of 132027013 is about 509.1990670622.
Adding to 132027013 its reverse (310720231), we get a palindrome (442747244).
The spelling of 132027013 in words is "one hundred thirty-two million, twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •