Base | Representation |
---|---|
bin | 110100010001000011… |
… | …0111110101100111101 |
3 | 101201201022000010122012 |
4 | 1220202012332230331 |
5 | 3314332244422413 |
6 | 123321334501005 |
7 | 11052306125063 |
oct | 1504206765475 |
9 | 351638003565 |
10 | 112241404733 |
11 | 4366838a717 |
12 | 19905504765 |
13 | a7799975b3 |
14 | 560ab5c033 |
15 | 2dbdc927a8 |
hex | 1a221beb3d |
112241404733 has 2 divisors, whose sum is σ = 112241404734. Its totient is φ = 112241404732.
The previous prime is 112241404729. The next prime is 112241404747. The reversal of 112241404733 is 337404142211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111503902084 + 737502649 = 333922^2 + 27157^2 .
It is a cyclic number.
It is not a de Polignac number, because 112241404733 - 22 = 112241404729 is a prime.
It is a super-2 number, since 2×1122414047332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112241404733.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112241404753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56120702366 + 56120702367.
It is an arithmetic number, because the mean of its divisors is an integer number (56120702367).
Almost surely, 2112241404733 is an apocalyptic number.
It is an amenable number.
112241404733 is a deficient number, since it is larger than the sum of its proper divisors (1).
112241404733 is an equidigital number, since it uses as much as digits as its factorization.
112241404733 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16128, while the sum is 32.
Adding to 112241404733 its reverse (337404142211), we get a palindrome (449645546944).
The spelling of 112241404733 in words is "one hundred twelve billion, two hundred forty-one million, four hundred four thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •