Base | Representation |
---|---|
bin | 11001011110001000110011… |
… | …011100000100010101100001 |
3 | 112200122012212201121222210202 |
4 | 121132020303130010111201 |
5 | 104140332431200310311 |
6 | 1034130142132034545 |
7 | 32411223355142234 |
oct | 3136106334042541 |
9 | 480565781558722 |
10 | 112022200010081 |
11 | 3276a391547149 |
12 | 106927a0162a55 |
13 | 4a67856c4656a |
14 | 1d93c90d5741b |
15 | ce3e4b67ae3b |
hex | 65e233704561 |
112022200010081 has 2 divisors, whose sum is σ = 112022200010082. Its totient is φ = 112022200010080.
The previous prime is 112022200010047. The next prime is 112022200010153. The reversal of 112022200010081 is 180010002220211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108621919329856 + 3400280680225 = 10422184^2 + 1843985^2 .
It is a cyclic number.
It is not a de Polignac number, because 112022200010081 - 242 = 107624153498977 is a prime.
It is a super-2 number, since 2×1120222000100812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112022200010011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56011100005040 + 56011100005041.
It is an arithmetic number, because the mean of its divisors is an integer number (56011100005041).
Almost surely, 2112022200010081 is an apocalyptic number.
It is an amenable number.
112022200010081 is a deficient number, since it is larger than the sum of its proper divisors (1).
112022200010081 is an equidigital number, since it uses as much as digits as its factorization.
112022200010081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 112022200010081 its reverse (180010002220211), we get a palindrome (292032202230292).
The spelling of 112022200010081 in words is "one hundred twelve trillion, twenty-two billion, two hundred million, ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •