Base | Representation |
---|---|
bin | 1111101111010… |
… | …10111000010101 |
3 | 100012110000200201 |
4 | 13313222320111 |
5 | 232300042234 |
6 | 21033540501 |
7 | 3162161656 |
oct | 767527025 |
9 | 305400621 |
10 | 132034069 |
11 | 68591172 |
12 | 38274731 |
13 | 2147b58b |
14 | 1376d52d |
15 | b8d1314 |
hex | 7deae15 |
132034069 has 2 divisors, whose sum is σ = 132034070. Its totient is φ = 132034068.
The previous prime is 132034031. The next prime is 132034103. The reversal of 132034069 is 960430231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82119844 + 49914225 = 9062^2 + 7065^2 .
It is an emirp because it is prime and its reverse (960430231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132034069 - 223 = 123645461 is a prime.
It is a super-3 number, since 3×1320340693 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132034009) 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, 66017034 + 66017035.
It is an arithmetic number, because the mean of its divisors is an integer number (66017035).
Almost surely, 2132034069 is an apocalyptic number.
It is an amenable number.
132034069 is a deficient number, since it is larger than the sum of its proper divisors (1).
132034069 is an equidigital number, since it uses as much as digits as its factorization.
132034069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 132034069 is about 11490.6078603353. The cubic root of 132034069 is about 509.2081380458.
The spelling of 132034069 in words is "one hundred thirty-two million, thirty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •