Base | Representation |
---|---|
bin | 1011000001100110010110… |
… | …0101101111010001100011 |
3 | 1120220212021010201111212212 |
4 | 2300121211211233101203 |
5 | 3042102031114213331 |
6 | 41440452233512335 |
7 | 2360535663522353 |
oct | 260314545572143 |
9 | 46825233644785 |
10 | 12122102101091 |
11 | 3953a55682654 |
12 | 14394175726ab |
13 | 69c15624c248 |
14 | 2dc9da19ab63 |
15 | 1604cc705d2b |
hex | b066596f463 |
12122102101091 has 2 divisors, whose sum is σ = 12122102101092. Its totient is φ = 12122102101090.
The previous prime is 12122102101019. The next prime is 12122102101121. The reversal of 12122102101091 is 19010120122121.
It is a happy number.
12122102101091 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (12122102101019) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (19010120122121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12122102101091 - 214 = 12122102084707 is a prime.
It is not a weakly prime, because it can be changed into another prime (12122102101001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061051050545 + 6061051050546.
It is an arithmetic number, because the mean of its divisors is an integer number (6061051050546).
Almost surely, 212122102101091 is an apocalyptic number.
12122102101091 is a deficient number, since it is larger than the sum of its proper divisors (1).
12122102101091 is an equidigital number, since it uses as much as digits as its factorization.
12122102101091 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 23.
The spelling of 12122102101091 in words is "twelve trillion, one hundred twenty-two billion, one hundred two million, one hundred one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •