Base | Representation |
---|---|
bin | 110100010000100100… |
… | …1000001100100010001 |
3 | 101201200011102222220102 |
4 | 1220201021001210101 |
5 | 3314314120213122 |
6 | 123315554422145 |
7 | 11052021102464 |
oct | 1504111014421 |
9 | 351604388812 |
10 | 112225163537 |
11 | 4365a1a7443 |
12 | 198bbb91955 |
13 | a7764cc016 |
14 | 56089312db |
15 | 2dbc635492 |
hex | 1a21241911 |
112225163537 has 2 divisors, whose sum is σ = 112225163538. Its totient is φ = 112225163536.
The previous prime is 112225163527. The next prime is 112225163591. The reversal of 112225163537 is 735361522211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67348554256 + 44876609281 = 259516^2 + 211841^2 .
It is a cyclic number.
It is not a de Polignac number, because 112225163537 - 26 = 112225163473 is a prime.
It is a super-4 number, since 4×1122251635374 (a number of 45 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112225163537.
It is not a weakly prime, because it can be changed into another prime (112225163527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56112581768 + 56112581769.
It is an arithmetic number, because the mean of its divisors is an integer number (56112581769).
Almost surely, 2112225163537 is an apocalyptic number.
It is an amenable number.
112225163537 is a deficient number, since it is larger than the sum of its proper divisors (1).
112225163537 is an equidigital number, since it uses as much as digits as its factorization.
112225163537 is an evil number, because the sum of its binary digits is even.
The product of its digits is 75600, while the sum is 38.
Adding to 112225163537 its reverse (735361522211), we get a palindrome (847586685748).
The spelling of 112225163537 in words is "one hundred twelve billion, two hundred twenty-five million, one hundred sixty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •