Base | Representation |
---|---|
bin | 110011110010101001… |
… | …0011100111110001001 |
3 | 101122002011221022101212 |
4 | 1213211102130332021 |
5 | 3310240034031441 |
6 | 123032204022505 |
7 | 11015105630255 |
oct | 1474522347611 |
9 | 348064838355 |
10 | 111221002121 |
11 | 431943a1079 |
12 | 1967b831a35 |
13 | a646465978 |
14 | 555141d265 |
15 | 2d5e3d0eeb |
hex | 19e549cf89 |
111221002121 has 2 divisors, whose sum is σ = 111221002122. Its totient is φ = 111221002120.
The previous prime is 111221002117. The next prime is 111221002157. The reversal of 111221002121 is 121200122111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67112601721 + 44108400400 = 259061^2 + 210020^2 .
It is a cyclic number.
It is not a de Polignac number, because 111221002121 - 22 = 111221002117 is a prime.
It is a super-3 number, since 3×1112210021213 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 111221002096 and 111221002105.
It is not a weakly prime, because it can be changed into another prime (111221001121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55610501060 + 55610501061.
It is an arithmetic number, because the mean of its divisors is an integer number (55610501061).
Almost surely, 2111221002121 is an apocalyptic number.
It is an amenable number.
111221002121 is a deficient number, since it is larger than the sum of its proper divisors (1).
111221002121 is an equidigital number, since it uses as much as digits as its factorization.
111221002121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111221002121 its reverse (121200122111), we get a palindrome (232421124232).
The spelling of 111221002121 in words is "one hundred eleven billion, two hundred twenty-one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •