Base | Representation |
---|---|
bin | 110100011111100010… |
… | …0110111101100011001 |
3 | 101202222011110210110121 |
4 | 1220333010313230121 |
5 | 3321331203003001 |
6 | 123441455113241 |
7 | 11100330004501 |
oct | 1507704675431 |
9 | 352864423417 |
10 | 112727391001 |
11 | 43897745365 |
12 | 19a20212821 |
13 | a826583c34 |
14 | 5655506a01 |
15 | 2deb78d6a1 |
hex | 1a3f137b19 |
112727391001 has 27 divisors (see below), whose sum is σ = 122228815359. Its totient is φ = 103947890400.
The previous prime is 112727390989. The next prime is 112727391013. The reversal of 112727391001 is 100193727211.
The square root of 112727391001 is 335749.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (112727390989) and next prime (112727391013).
It can be written as a sum of positive squares in only one way, i.e., 5431837401 + 107295553600 = 73701^2 + 327560^2 .
It is not a de Polignac number, because 112727391001 - 217 = 112727259929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112727391031) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 261548256 + ... + 261548686.
Almost surely, 2112727391001 is an apocalyptic number.
112727391001 is the 335749-th square number.
112727391001 is the 167875-th centered octagonal number.
It is an amenable number.
112727391001 is a deficient number, since it is larger than the sum of its proper divisors (9501424358).
112727391001 is an frugal number, since it uses more digits than its factorization.
112727391001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 5292, while the sum is 34.
The spelling of 112727391001 in words is "one hundred twelve billion, seven hundred twenty-seven million, three hundred ninety-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •