Base | Representation |
---|---|
bin | 110100001001111100… |
… | …0011110100100110101 |
3 | 101201002122212210121201 |
4 | 1220103320132210311 |
5 | 3313340144101401 |
6 | 123241531012501 |
7 | 11043350300254 |
oct | 1502370364465 |
9 | 351078783551 |
10 | 112002722101 |
11 | 43555686946 |
12 | 1985959a131 |
13 | a73c3b827a |
14 | 55c718a79b |
15 | 2da7d46b01 |
hex | 1a13e1e935 |
112002722101 has 2 divisors, whose sum is σ = 112002722102. Its totient is φ = 112002722100.
The previous prime is 112002722047. The next prime is 112002722129. The reversal of 112002722101 is 101227200211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102896600625 + 9106121476 = 320775^2 + 95426^2 .
It is an emirp because it is prime and its reverse (101227200211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112002722101 - 215 = 112002689333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112002722131) 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, 56001361050 + 56001361051.
It is an arithmetic number, because the mean of its divisors is an integer number (56001361051).
Almost surely, 2112002722101 is an apocalyptic number.
It is an amenable number.
112002722101 is a deficient number, since it is larger than the sum of its proper divisors (1).
112002722101 is an equidigital number, since it uses as much as digits as its factorization.
112002722101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 112002722101 its reverse (101227200211), we get a palindrome (213229922312).
The spelling of 112002722101 in words is "one hundred twelve billion, two million, seven hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •