Base | Representation |
---|---|
bin | 110100001010011111… |
… | …0111110000010001101 |
3 | 101201010221122121221202 |
4 | 1220110332332002031 |
5 | 3313404411413122 |
6 | 123243431035245 |
7 | 11043663332564 |
oct | 1502476760215 |
9 | 351127577852 |
10 | 112021201037 |
11 | 43565058399 |
12 | 1986380bb25 |
13 | a743188255 |
14 | 55c97dabdb |
15 | 2da9796e92 |
hex | 1a14fbe08d |
112021201037 has 2 divisors, whose sum is σ = 112021201038. Its totient is φ = 112021201036.
The previous prime is 112021201031. The next prime is 112021201057. The reversal of 112021201037 is 730102120211.
It is an a-pointer prime, because the next prime (112021201057) can be obtained adding 112021201037 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104839316521 + 7181884516 = 323789^2 + 84746^2 .
It is a cyclic number.
It is not a de Polignac number, because 112021201037 - 230 = 110947459213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112021201031) 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, 56010600518 + 56010600519.
It is an arithmetic number, because the mean of its divisors is an integer number (56010600519).
Almost surely, 2112021201037 is an apocalyptic number.
It is an amenable number.
112021201037 is a deficient number, since it is larger than the sum of its proper divisors (1).
112021201037 is an equidigital number, since it uses as much as digits as its factorization.
112021201037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 112021201037 its reverse (730102120211), we get a palindrome (842123321248).
The spelling of 112021201037 in words is "one hundred twelve billion, twenty-one million, two hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •