Base | Representation |
---|---|
bin | 110100010100111110… |
… | …0000100001111101101 |
3 | 101202001110011202100122 |
4 | 1220221330010033231 |
5 | 3320114411332311 |
6 | 123342350134325 |
7 | 11055462466463 |
oct | 1505174041755 |
9 | 352043152318 |
10 | 112372761581 |
11 | 43725548aa3 |
12 | 199414b13a5 |
13 | a79ac69842 |
14 | 5620392833 |
15 | 2dca58d0db |
hex | 1a29f043ed |
112372761581 has 2 divisors, whose sum is σ = 112372761582. Its totient is φ = 112372761580.
The previous prime is 112372761541. The next prime is 112372761593. The reversal of 112372761581 is 185167273211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90305659081 + 22067102500 = 300509^2 + 148550^2 .
It is an emirp because it is prime and its reverse (185167273211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112372761581 - 234 = 95192892397 is a prime.
It is a super-2 number, since 2×1123727615812 (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 (112372761541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56186380790 + 56186380791.
It is an arithmetic number, because the mean of its divisors is an integer number (56186380791).
Almost surely, 2112372761581 is an apocalyptic number.
It is an amenable number.
112372761581 is a deficient number, since it is larger than the sum of its proper divisors (1).
112372761581 is an equidigital number, since it uses as much as digits as its factorization.
112372761581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 141120, while the sum is 44.
The spelling of 112372761581 in words is "one hundred twelve billion, three hundred seventy-two million, seven hundred sixty-one thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •