Base | Representation |
---|---|
bin | 1010000110110011100000… |
… | …1000010111100000011001 |
3 | 1110100022001221000121020221 |
4 | 2201230320020113200121 |
5 | 2424024410130043111 |
6 | 35344443102120041 |
7 | 2224550160343006 |
oct | 241547010274031 |
9 | 43308057017227 |
10 | 11112022112281 |
11 | 35a46448799a2 |
12 | 12b5701880021 |
13 | 627b2283acac |
14 | 2a5b7912c8ad |
15 | 1440b1081371 |
hex | a1b38217819 |
11112022112281 has 2 divisors, whose sum is σ = 11112022112282. Its totient is φ = 11112022112280.
The previous prime is 11112022112267. The next prime is 11112022112327. The reversal of 11112022112281 is 18221122021111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6690065018256 + 4421957094025 = 2586516^2 + 2102845^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112022112281 - 213 = 11112022104089 is a prime.
It is a super-2 number, since 2×111120221122812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11112022122281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556011056140 + 5556011056141.
It is an arithmetic number, because the mean of its divisors is an integer number (5556011056141).
Almost surely, 211112022112281 is an apocalyptic number.
It is an amenable number.
11112022112281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112022112281 is an equidigital number, since it uses as much as digits as its factorization.
11112022112281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 25.
Adding to 11112022112281 its reverse (18221122021111), we get a palindrome (29333144133392).
The spelling of 11112022112281 in words is "eleven trillion, one hundred twelve billion, twenty-two million, one hundred twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •