Base | Representation |
---|---|
bin | 10000010101010100111… |
… | …110110100111010111101 |
3 | 10222022010211121111212102 |
4 | 100111110332310322331 |
5 | 121342200012020333 |
6 | 2215343513114445 |
7 | 144043264312043 |
oct | 20252476647275 |
9 | 3868124544772 |
10 | 1122412220093 |
11 | 3a301548973a |
12 | 1616456b8a25 |
13 | 81ac6159a78 |
14 | 3c479cb0393 |
15 | 1e2e33a8ae8 |
hex | 10554fb4ebd |
1122412220093 has 2 divisors, whose sum is σ = 1122412220094. Its totient is φ = 1122412220092.
The previous prime is 1122412220089. The next prime is 1122412220099. The reversal of 1122412220093 is 3900222142211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 916924983844 + 205487236249 = 957562^2 + 453307^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122412220093 - 22 = 1122412220089 is a prime.
It is a super-3 number, since 3×11224122200933 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122412220099) 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, 561206110046 + 561206110047.
It is an arithmetic number, because the mean of its divisors is an integer number (561206110047).
Almost surely, 21122412220093 is an apocalyptic number.
It is an amenable number.
1122412220093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122412220093 is an equidigital number, since it uses as much as digits as its factorization.
1122412220093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 1122412220093 in words is "one trillion, one hundred twenty-two billion, four hundred twelve million, two hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •