Base | Representation |
---|---|
bin | 111101100011111001… |
… | …1100011110110000101 |
3 | 110122020022212211202212 |
4 | 1323013303203312011 |
5 | 4131222001413104 |
6 | 140422110313205 |
7 | 12360032445032 |
oct | 1730763436605 |
9 | 418208784685 |
10 | 132201201029 |
11 | 5108014a037 |
12 | 21755ab8805 |
13 | c60ac36a51 |
14 | 658197a389 |
15 | 368b21b36e |
hex | 1ec7ce3d85 |
132201201029 has 8 divisors (see below), whose sum is σ = 141216485400. Its totient is φ = 123323554816.
The previous prime is 132201201007. The next prime is 132201201073. The reversal of 132201201029 is 920102102231.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 26119408225 + 106081792804 = 161615^2 + 325702^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132201201029 - 232 = 127906233733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132201200995 and 132201201013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132201201329) 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, 34407554 + ... + 34411395.
It is an arithmetic number, because the mean of its divisors is an integer number (17652060675).
Almost surely, 2132201201029 is an apocalyptic number.
It is an amenable number.
132201201029 is a deficient number, since it is larger than the sum of its proper divisors (9015284371).
132201201029 is a wasteful number, since it uses less digits than its factorization.
132201201029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68819079.
The product of its (nonzero) digits is 432, while the sum is 23.
The spelling of 132201201029 in words is "one hundred thirty-two billion, two hundred one million, two hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •