Base | Representation |
---|---|
bin | 111101100111101111… |
… | …1011001011101001001 |
3 | 110122120022111021121221 |
4 | 1323033133121131021 |
5 | 4132003003231241 |
6 | 140442554002041 |
7 | 12363156400651 |
oct | 1731737313511 |
9 | 418508437557 |
10 | 132330133321 |
11 | 51136a01851 |
12 | 21791116321 |
13 | c62b86a549 |
14 | 6594b3d361 |
15 | 36976d85d1 |
hex | 1ecf7d9749 |
132330133321 has 4 divisors (see below), whose sum is σ = 139294877200. Its totient is φ = 125365389444.
The previous prime is 132330133277. The next prime is 132330133361. The reversal of 132330133321 is 123331033231.
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 132330133321 - 213 = 132330125129 is a prime.
It is a super-2 number, since 2×1323301333212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132330133361) 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, 3482371911 + ... + 3482371948.
It is an arithmetic number, because the mean of its divisors is an integer number (34823719300).
Almost surely, 2132330133321 is an apocalyptic number.
It is an amenable number.
132330133321 is a deficient number, since it is larger than the sum of its proper divisors (6964743879).
132330133321 is an equidigital number, since it uses as much as digits as its factorization.
132330133321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6964743878.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 132330133321 its reverse (123331033231), we get a palindrome (255661166552).
The spelling of 132330133321 in words is "one hundred thirty-two billion, three hundred thirty million, one hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •