Base | Representation |
---|---|
bin | 111101100111011100… |
… | …1100101101101001111 |
3 | 110122112121211201220010 |
4 | 1323032321211231033 |
5 | 4131442434101111 |
6 | 140442001324303 |
7 | 12363006221034 |
oct | 1731671455517 |
9 | 418477751803 |
10 | 132320222031 |
11 | 511313522a8 |
12 | 21789936693 |
13 | c6297aa18a |
14 | 65936bd38b |
15 | 36968cbaa6 |
hex | 1ecee65b4f |
132320222031 has 8 divisors (see below), whose sum is σ = 180180728064. Its totient is φ = 86336598680.
The previous prime is 132320221997. The next prime is 132320222051. The reversal of 132320222031 is 130222023231.
It is a happy number.
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 132320222031 - 219 = 132319697743 is a prime.
It is a super-2 number, since 2×1323202220312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132320221989 and 132320222007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132320222051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 469220505 + ... + 469220786.
It is an arithmetic number, because the mean of its divisors is an integer number (22522591008).
Almost surely, 2132320222031 is an apocalyptic number.
132320222031 is a deficient number, since it is larger than the sum of its proper divisors (47860506033).
132320222031 is an equidigital number, since it uses as much as digits as its factorization.
132320222031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 938441341.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 132320222031 its reverse (130222023231), we get a palindrome (262542245262).
The spelling of 132320222031 in words is "one hundred thirty-two billion, three hundred twenty million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •