Base | Representation |
---|---|
bin | 11001011111010001010001… |
… | …111100000000010111001011 |
3 | 112200220122202012202111002211 |
4 | 121133101101330000113023 |
5 | 104143121320401011334 |
6 | 1034230012212205551 |
7 | 32416650011445142 |
oct | 3137212174002713 |
9 | 480818665674084 |
10 | 112100021110219 |
11 | 3279a39652553a |
12 | 106a589a3098b7 |
13 | 4a71ca9826acc |
14 | 1d97954588759 |
15 | ce5ea36e9a64 |
hex | 65f451f005cb |
112100021110219 has 2 divisors, whose sum is σ = 112100021110220. Its totient is φ = 112100021110218.
The previous prime is 112100021110081. The next prime is 112100021110339. The reversal of 112100021110219 is 912011120001211.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112100021110219 - 239 = 111550265296331 is a prime.
It is a super-2 number, since 2×1121000211102192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112100021110219.
It is not a weakly prime, because it can be changed into another prime (112100021180219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050010555109 + 56050010555110.
It is an arithmetic number, because the mean of its divisors is an integer number (56050010555110).
Almost surely, 2112100021110219 is an apocalyptic number.
112100021110219 is a deficient number, since it is larger than the sum of its proper divisors (1).
112100021110219 is an equidigital number, since it uses as much as digits as its factorization.
112100021110219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 112100021110219 in words is "one hundred twelve trillion, one hundred billion, twenty-one million, one hundred ten thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •