Base | Representation |
---|---|
bin | 111101100111011110… |
… | …1101111011001111101 |
3 | 110122112200220000202121 |
4 | 1323032331233121331 |
5 | 4131443223412313 |
6 | 140442040522541 |
7 | 12363021402652 |
oct | 1731675573175 |
9 | 418480800677 |
10 | 132321310333 |
11 | 51131a25a23 |
12 | 2178a180451 |
13 | c629a9b644 |
14 | 65938c3c29 |
15 | 3696a4428d |
hex | 1ecef6f67d |
132321310333 has 4 divisors (see below), whose sum is σ = 132322675680. Its totient is φ = 132319944988.
The previous prime is 132321310267. The next prime is 132321310337. The reversal of 132321310333 is 333013123231.
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 a de Polignac number, because none of the positive numbers 2k-132321310333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132321310298 and 132321310307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132321310337) 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, 525193 + ... + 735166.
It is an arithmetic number, because the mean of its divisors is an integer number (33080668920).
Almost surely, 2132321310333 is an apocalyptic number.
It is an amenable number.
132321310333 is a deficient number, since it is larger than the sum of its proper divisors (1365347).
132321310333 is a wasteful number, since it uses less digits than its factorization.
132321310333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365346.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 132321310333 its reverse (333013123231), we get a palindrome (465334433564).
The spelling of 132321310333 in words is "one hundred thirty-two billion, three hundred twenty-one million, three hundred ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •