Base | Representation |
---|---|
bin | 111000011001000110… |
… | …0000010011111100011 |
3 | 102120120202002100010222 |
4 | 1300302030002133203 |
5 | 3441003340213102 |
6 | 131344424513255 |
7 | 11514666242324 |
oct | 1606214023743 |
9 | 376522070128 |
10 | 121101101027 |
11 | 473a4461675 |
12 | 1b57861b82b |
13 | b55c36223a |
14 | 5c0b69044b |
15 | 323b9a7aa2 |
hex | 1c323027e3 |
121101101027 has 2 divisors, whose sum is σ = 121101101028. Its totient is φ = 121101101026.
The previous prime is 121101100993. The next prime is 121101101041. The reversal of 121101101027 is 720101101121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121101101027 - 228 = 120832665571 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121101100996 and 121101101014.
It is not a weakly prime, because it can be changed into another prime (121101101057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60550550513 + 60550550514.
It is an arithmetic number, because the mean of its divisors is an integer number (60550550514).
Almost surely, 2121101101027 is an apocalyptic number.
121101101027 is a deficient number, since it is larger than the sum of its proper divisors (1).
121101101027 is an equidigital number, since it uses as much as digits as its factorization.
121101101027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 121101101027 its reverse (720101101121), we get a palindrome (841202202148).
The spelling of 121101101027 in words is "one hundred twenty-one billion, one hundred one million, one hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •