Base | Representation |
---|---|
bin | 110100001010100011… |
… | …0101001000010111101 |
3 | 101201011002102210210001 |
4 | 1220111012221002331 |
5 | 3313410420242341 |
6 | 123243542114301 |
7 | 11044016410234 |
oct | 1502506510275 |
9 | 351132383701 |
10 | 112023212221 |
11 | 43566201428 |
12 | 1986441b991 |
13 | a7437107bb |
14 | 55c9ba1b1b |
15 | 2da9a42d31 |
hex | 1a151a90bd |
112023212221 has 2 divisors, whose sum is σ = 112023212222. Its totient is φ = 112023212220.
The previous prime is 112023212209. The next prime is 112023212227. The reversal of 112023212221 is 122212320211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110699271225 + 1323940996 = 332715^2 + 36386^2 .
It is a cyclic number.
It is not a de Polignac number, because 112023212221 - 225 = 111989657789 is a prime.
It is a super-2 number, since 2×1120232122212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112023212227) 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, 56011606110 + 56011606111.
It is an arithmetic number, because the mean of its divisors is an integer number (56011606111).
Almost surely, 2112023212221 is an apocalyptic number.
It is an amenable number.
112023212221 is a deficient number, since it is larger than the sum of its proper divisors (1).
112023212221 is an equidigital number, since it uses as much as digits as its factorization.
112023212221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 112023212221 its reverse (122212320211), we get a palindrome (234235532432).
The spelling of 112023212221 in words is "one hundred twelve billion, twenty-three million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •