Base | Representation |
---|---|
bin | 110100010000110001… |
… | …1100110111001111101 |
3 | 101201200122120001010211 |
4 | 1220201203212321331 |
5 | 3314322411212341 |
6 | 123320404032421 |
7 | 11052134245366 |
oct | 1504143467175 |
9 | 351618501124 |
10 | 112232132221 |
11 | 43663127090 |
12 | 19902392711 |
13 | a777a9bbc1 |
14 | 5609826b6d |
15 | 2dbd060181 |
hex | 1a218e6e7d |
112232132221 has 8 divisors (see below), whose sum is σ = 122440082688. Its totient is φ = 102025020000.
The previous prime is 112232132143. The next prime is 112232132291. The reversal of 112232132221 is 122231232211.
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 112232132221 - 213 = 112232124029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112232132192 and 112232132201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112232132291) 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, 88881 + ... + 482041.
It is an arithmetic number, because the mean of its divisors is an integer number (15305010336).
Almost surely, 2112232132221 is an apocalyptic number.
112232132221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112232132221 is a deficient number, since it is larger than the sum of its proper divisors (10207950467).
112232132221 is a wasteful number, since it uses less digits than its factorization.
112232132221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 419123.
The product of its digits is 576, while the sum is 22.
Adding to 112232132221 its reverse (122231232211), we get a palindrome (234463364432).
The spelling of 112232132221 in words is "one hundred twelve billion, two hundred thirty-two million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •