Base | Representation |
---|---|
bin | 11011100100000000110010… |
… | …010000010100001100010111 |
3 | 120220012201011121120000201211 |
4 | 123210000302100110030113 |
5 | 111342100124011200434 |
6 | 1105452341300002251 |
7 | 34351000111513612 |
oct | 3344006220241427 |
9 | 526181147500654 |
10 | 121222000100119 |
11 | 35696a63895126 |
12 | 11719776690387 |
13 | 52842548a00a9 |
14 | 21d1267363179 |
15 | e033e098e464 |
hex | 6e4032414317 |
121222000100119 has 2 divisors, whose sum is σ = 121222000100120. Its totient is φ = 121222000100118.
The previous prime is 121222000100087. The next prime is 121222000100191. The reversal of 121222000100119 is 911001000222121.
Together with next prime (121222000100191) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121222000100119 - 25 = 121222000100087 is a prime.
It is a super-2 number, since 2×1212220001001192 (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 121222000100119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121222000100419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60611000050059 + 60611000050060.
It is an arithmetic number, because the mean of its divisors is an integer number (60611000050060).
Almost surely, 2121222000100119 is an apocalyptic number.
121222000100119 is a deficient number, since it is larger than the sum of its proper divisors (1).
121222000100119 is an equidigital number, since it uses as much as digits as its factorization.
121222000100119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 121222000100119 in words is "one hundred twenty-one trillion, two hundred twenty-two billion, one hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •