Base | Representation |
---|---|
bin | 11011100000110100000110… |
… | …010101110110100100100101 |
3 | 120212102200212202120021011111 |
4 | 123200310012111312210211 |
5 | 111330000021311201203 |
6 | 1105203352534105021 |
7 | 34326056545622536 |
oct | 3340640625664445 |
9 | 525380782507144 |
10 | 121002220022053 |
11 | 35611831754577 |
12 | 116a305a7ab171 |
13 | 52695ca617316 |
14 | 21c477828668d |
15 | dec82ac4126d |
hex | 6e0d06576925 |
121002220022053 has 2 divisors, whose sum is σ = 121002220022054. Its totient is φ = 121002220022052.
The previous prime is 121002220022051. The next prime is 121002220022113. The reversal of 121002220022053 is 350220022200121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68737663109124 + 52264556912929 = 8290818^2 + 7229423^2 .
It is a cyclic number.
It is not a de Polignac number, because 121002220022053 - 21 = 121002220022051 is a prime.
Together with 121002220022051, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121002220022051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60501110011026 + 60501110011027.
It is an arithmetic number, because the mean of its divisors is an integer number (60501110011027).
Almost surely, 2121002220022053 is an apocalyptic number.
It is an amenable number.
121002220022053 is a deficient number, since it is larger than the sum of its proper divisors (1).
121002220022053 is an equidigital number, since it uses as much as digits as its factorization.
121002220022053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 121002220022053 its reverse (350220022200121), we get a palindrome (471222242222174).
The spelling of 121002220022053 in words is "one hundred twenty-one trillion, two billion, two hundred twenty million, twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •