Base | Representation |
---|---|
bin | 111101011101111101… |
… | …1101101011111111101 |
3 | 110121201110001221121022 |
4 | 1322323323231133331 |
5 | 4130320003324013 |
6 | 140350233113525 |
7 | 12352063403336 |
oct | 1727373553775 |
9 | 417643057538 |
10 | 132002011133 |
11 | 50a8876a793 |
12 | 216bb2588a5 |
13 | c5a88a43c5 |
14 | 656332928d |
15 | 36789c2008 |
hex | 1ebbeed7fd |
132002011133 has 4 divisors (see below), whose sum is σ = 132025492128. Its totient is φ = 131978530140.
The previous prime is 132002011117. The next prime is 132002011147. The reversal of 132002011133 is 331110200231.
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 132002011133 - 24 = 132002011117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132002011103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11732063 + ... + 11743308.
It is an arithmetic number, because the mean of its divisors is an integer number (33006373032).
Almost surely, 2132002011133 is an apocalyptic number.
It is an amenable number.
132002011133 is a deficient number, since it is larger than the sum of its proper divisors (23480995).
132002011133 is an equidigital number, since it uses as much as digits as its factorization.
132002011133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23480994.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132002011133 its reverse (331110200231), we get a palindrome (463112211364).
The spelling of 132002011133 in words is "one hundred thirty-two billion, two million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •