Base | Representation |
---|---|
bin | 10000001011110100010… |
… | …010010011100000111111 |
3 | 10221022210010112001200211 |
4 | 100023310102103200333 |
5 | 121210241200022344 |
6 | 2210534305533251 |
7 | 143232232013221 |
oct | 20136422234077 |
9 | 3838703461624 |
10 | 1112200001599 |
11 | 3997549a6845 |
12 | 15b675644227 |
13 | 80b594c7a2b |
14 | 3bb8b8a8411 |
15 | 1dde6a7b334 |
hex | 102f449383f |
1112200001599 has 2 divisors, whose sum is σ = 1112200001600. Its totient is φ = 1112200001598.
The previous prime is 1112200001593. The next prime is 1112200001603. The reversal of 1112200001599 is 9951000022111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1112200001599 - 237 = 974761048127 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1112200001599.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112200001593) 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, 556100000799 + 556100000800.
It is an arithmetic number, because the mean of its divisors is an integer number (556100000800).
Almost surely, 21112200001599 is an apocalyptic number.
1112200001599 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112200001599 is an equidigital number, since it uses as much as digits as its factorization.
1112200001599 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 31.
The spelling of 1112200001599 in words is "one trillion, one hundred twelve billion, two hundred million, one thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •