Base | Representation |
---|---|
bin | 110100010011101101… |
… | …0001011000001100101 |
3 | 101201221111022121020002 |
4 | 1220213122023001211 |
5 | 3320023030301041 |
6 | 123334232351045 |
7 | 11054435661131 |
oct | 1504732130145 |
9 | 351844277202 |
10 | 112330322021 |
11 | 437035a1585 |
12 | 1992b245485 |
13 | a79222a788 |
14 | 56188a63c1 |
15 | 2dc69a859b |
hex | 1a2768b065 |
112330322021 has 2 divisors, whose sum is σ = 112330322022. Its totient is φ = 112330322020.
The previous prime is 112330322011. The next prime is 112330322033. The reversal of 112330322021 is 120223033211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105894271396 + 6436050625 = 325414^2 + 80225^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112330322021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112330321984 and 112330322002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112330322011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56165161010 + 56165161011.
It is an arithmetic number, because the mean of its divisors is an integer number (56165161011).
Almost surely, 2112330322021 is an apocalyptic number.
It is an amenable number.
112330322021 is a deficient number, since it is larger than the sum of its proper divisors (1).
112330322021 is an equidigital number, since it uses as much as digits as its factorization.
112330322021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 112330322021 its reverse (120223033211), we get a palindrome (232553355232).
The spelling of 112330322021 in words is "one hundred twelve billion, three hundred thirty million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •