Base | Representation |
---|---|
bin | 110100100101110001… |
… | …1011111110010011001 |
3 | 101210111202102010201112 |
4 | 1221023203133302121 |
5 | 3322243301334022 |
6 | 123514334230105 |
7 | 11105451334355 |
oct | 1511343376231 |
9 | 353452363645 |
10 | 112936746137 |
11 | 43994937a36 |
12 | 19a7a355335 |
13 | a85aa65407 |
14 | 5675242465 |
15 | 2e0ed448e2 |
hex | 1a4b8dfc99 |
112936746137 has 2 divisors, whose sum is σ = 112936746138. Its totient is φ = 112936746136.
The previous prime is 112936746113. The next prime is 112936746173. The reversal of 112936746137 is 731647639211.
Together with next prime (112936746173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73429618441 + 39507127696 = 270979^2 + 198764^2 .
It is a cyclic number.
It is not a de Polignac number, because 112936746137 - 210 = 112936745113 is a prime.
It is not a weakly prime, because it can be changed into another prime (112936746737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56468373068 + 56468373069.
It is an arithmetic number, because the mean of its divisors is an integer number (56468373069).
Almost surely, 2112936746137 is an apocalyptic number.
It is an amenable number.
112936746137 is a deficient number, since it is larger than the sum of its proper divisors (1).
112936746137 is an equidigital number, since it uses as much as digits as its factorization.
112936746137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1143072, while the sum is 50.
The spelling of 112936746137 in words is "one hundred twelve billion, nine hundred thirty-six million, seven hundred forty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •