Base | Representation |
---|---|
bin | 110100001100111000… |
… | …0010000100111010101 |
3 | 101201100112020120111201 |
4 | 1220121300100213111 |
5 | 3314040403343221 |
6 | 123255410232501 |
7 | 11045654512351 |
oct | 1503160204725 |
9 | 351315216451 |
10 | 112101231061 |
11 | 435a624a106 |
12 | 19886585731 |
13 | a7569291b1 |
14 | 55d62b0461 |
15 | 2db1804891 |
hex | 1a19c109d5 |
112101231061 has 2 divisors, whose sum is σ = 112101231062. Its totient is φ = 112101231060.
The previous prime is 112101231019. The next prime is 112101231083. The reversal of 112101231061 is 160132101211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98410827025 + 13690404036 = 313705^2 + 117006^2 .
It is an emirp because it is prime and its reverse (160132101211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112101231061 - 225 = 112067676629 is a prime.
It is a super-2 number, since 2×1121012310612 (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 (112101231461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050615530 + 56050615531.
It is an arithmetic number, because the mean of its divisors is an integer number (56050615531).
Almost surely, 2112101231061 is an apocalyptic number.
It is an amenable number.
112101231061 is a deficient number, since it is larger than the sum of its proper divisors (1).
112101231061 is an equidigital number, since it uses as much as digits as its factorization.
112101231061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 112101231061 its reverse (160132101211), we get a palindrome (272233332272).
The spelling of 112101231061 in words is "one hundred twelve billion, one hundred one million, two hundred thirty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •