Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0111010010111011101 |
3 | 110122020022120012201102 |
4 | 1323013302322113131 |
5 | 4131221430444013 |
6 | 140422102522445 |
7 | 12360031136513 |
oct | 1730762722735 |
9 | 418208505642 |
10 | 132201031133 |
11 | 51080043426 |
12 | 21755a36425 |
13 | c60aba7612 |
14 | 65819344b3 |
15 | 368b1d5d58 |
hex | 1ec7cba5dd |
132201031133 has 4 divisors (see below), whose sum is σ = 139158980160. Its totient is φ = 125243082108.
The previous prime is 132201031103. The next prime is 132201031141. The reversal of 132201031133 is 331130102231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132201031133 - 210 = 132201030109 is a prime.
It is a super-2 number, since 2×1322010311332 (a number of 23 digits) 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 (132201031103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3478974485 + ... + 3478974522.
It is an arithmetic number, because the mean of its divisors is an integer number (34789745040).
Almost surely, 2132201031133 is an apocalyptic number.
It is an amenable number.
132201031133 is a deficient number, since it is larger than the sum of its proper divisors (6957949027).
132201031133 is an equidigital number, since it uses as much as digits as its factorization.
132201031133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6957949026.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 132201031133 its reverse (331130102231), we get a palindrome (463331133364).
The spelling of 132201031133 in words is "one hundred thirty-two billion, two hundred one million, thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •