Base | Representation |
---|---|
bin | 110100001101010000… |
… | …1001011000000001101 |
3 | 101201101102101000002021 |
4 | 1220122201023000031 |
5 | 3314102144200013 |
6 | 123300545130141 |
7 | 11046201504445 |
oct | 1503241130015 |
9 | 351342330067 |
10 | 112114053133 |
11 | 43602507565 |
12 | 1988a929951 |
13 | a759498414 |
14 | 55d7c8b125 |
15 | 2db29d8a8d |
hex | 1a1a84b00d |
112114053133 has 2 divisors, whose sum is σ = 112114053134. Its totient is φ = 112114053132.
The previous prime is 112114053109. The next prime is 112114053143. The reversal of 112114053133 is 331350411211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91938123369 + 20175929764 = 303213^2 + 142042^2 .
It is an emirp because it is prime and its reverse (331350411211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112114053133 - 221 = 112111955981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112114053098 and 112114053107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112114053143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56057026566 + 56057026567.
It is an arithmetic number, because the mean of its divisors is an integer number (56057026567).
Almost surely, 2112114053133 is an apocalyptic number.
It is an amenable number.
112114053133 is a deficient number, since it is larger than the sum of its proper divisors (1).
112114053133 is an equidigital number, since it uses as much as digits as its factorization.
112114053133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 112114053133 its reverse (331350411211), we get a palindrome (443464464344).
The spelling of 112114053133 in words is "one hundred twelve billion, one hundred fourteen million, fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •