Base | Representation |
---|---|
bin | 111101011110100100… |
… | …0101110011011011111 |
3 | 110121202212001122120021 |
4 | 1322331020232123133 |
5 | 4130340140400111 |
6 | 140352233533011 |
7 | 12352430120161 |
oct | 1727510563337 |
9 | 417685048507 |
10 | 132022200031 |
11 | 50a990a9a27 |
12 | 21705b74167 |
13 | c5acb227b7 |
14 | 6565ca2931 |
15 | 367a65dd71 |
hex | 1ebd22e6df |
132022200031 has 4 divisors (see below), whose sum is σ = 133693367200. Its totient is φ = 130351032864.
The previous prime is 132022200029. The next prime is 132022200047. The reversal of 132022200031 is 130002220231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132022200031 - 21 = 132022200029 is a prime.
It is a super-2 number, since 2×1320222000312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132022199978 and 132022200014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132025200031) 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, 835583466 + ... + 835583623.
It is an arithmetic number, because the mean of its divisors is an integer number (33423341800).
Almost surely, 2132022200031 is an apocalyptic number.
132022200031 is a deficient number, since it is larger than the sum of its proper divisors (1671167169).
132022200031 is an equidigital number, since it uses as much as digits as its factorization.
132022200031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1671167168.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 132022200031 its reverse (130002220231), we get a palindrome (262024420262).
The spelling of 132022200031 in words is "one hundred thirty-two billion, twenty-two million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •