Base | Representation |
---|---|
bin | 111000100010101011… |
… | …0001101000110101001 |
3 | 102121102010220202222002 |
4 | 1301011112031012221 |
5 | 3442133132024113 |
6 | 131440350140345 |
7 | 11525651334014 |
oct | 1610526150651 |
9 | 377363822862 |
10 | 121422533033 |
11 | 4754994425a |
12 | 1b6481b16b5 |
13 | b5b0b251a9 |
14 | 5c3c24237b |
15 | 3259cebc58 |
hex | 1c4558d1a9 |
121422533033 has 2 divisors, whose sum is σ = 121422533034. Its totient is φ = 121422533032.
The previous prime is 121422533009. The next prime is 121422533101. The reversal of 121422533033 is 330335224121.
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., 102100699024 + 19321834009 = 319532^2 + 139003^2 .
It is a cyclic number.
It is not a de Polignac number, because 121422533033 - 216 = 121422467497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121422532987 and 121422533005.
It is not a weakly prime, because it can be changed into another prime (121422533833) 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, 60711266516 + 60711266517.
It is an arithmetic number, because the mean of its divisors is an integer number (60711266517).
Almost surely, 2121422533033 is an apocalyptic number.
It is an amenable number.
121422533033 is a deficient number, since it is larger than the sum of its proper divisors (1).
121422533033 is an equidigital number, since it uses as much as digits as its factorization.
121422533033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 121422533033 its reverse (330335224121), we get a palindrome (451757757154).
The spelling of 121422533033 in words is "one hundred twenty-one billion, four hundred twenty-two million, five hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •