Base | Representation |
---|---|
bin | 111101100001110111… |
… | …1011100001101101101 |
3 | 110122001120120111110121 |
4 | 1323003233130031231 |
5 | 4131102022343313 |
6 | 140411233004541 |
7 | 12355244034130 |
oct | 1730357341555 |
9 | 418046514417 |
10 | 132133012333 |
11 | 51045705943 |
12 | 217370b3751 |
13 | c5c9a807ca |
14 | 65768aa217 |
15 | 368524c28d |
hex | 1ec3bdc36d |
132133012333 has 8 divisors (see below), whose sum is σ = 151583338368. Its totient is φ = 112826231664.
The previous prime is 132133012331. The next prime is 132133012343. The reversal of 132133012333 is 333210331231.
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 132133012333 - 21 = 132133012331 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132133012298 and 132133012307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132133012331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35884366 + ... + 35888047.
It is an arithmetic number, because the mean of its divisors is an integer number (18947917296).
Almost surely, 2132133012333 is an apocalyptic number.
It is an amenable number.
132133012333 is a deficient number, since it is larger than the sum of its proper divisors (19450326035).
132133012333 is an equidigital number, since it uses as much as digits as its factorization.
132133012333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71772683.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 132133012333 its reverse (333210331231), we get a palindrome (465343343564).
The spelling of 132133012333 in words is "one hundred thirty-two billion, one hundred thirty-three million, twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •