Base | Representation |
---|---|
bin | 11011100000110011111111… |
… | …111001110111011000000001 |
3 | 120212102200121020100021222011 |
4 | 123200303333321313120001 |
5 | 111324444311134201032 |
6 | 1105203334115212521 |
7 | 34326054064630612 |
oct | 3340637771673001 |
9 | 525380536307864 |
10 | 121002112022017 |
11 | 35611786799546 |
12 | 116a302a5a7141 |
13 | 52695b1132385 |
14 | 21c4767bb1c09 |
15 | dec82150b247 |
hex | 6e0cffe77601 |
121002112022017 has 2 divisors, whose sum is σ = 121002112022018. Its totient is φ = 121002112022016.
The previous prime is 121002112021997. The next prime is 121002112022047. The reversal of 121002112022017 is 710220211200121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98454894933136 + 22547217088881 = 9922444^2 + 4748391^2 .
It is a cyclic number.
It is not a de Polignac number, because 121002112022017 - 215 = 121002111989249 is a prime.
It is a super-2 number, since 2×1210021120220172 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121002112022047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60501056011008 + 60501056011009.
It is an arithmetic number, because the mean of its divisors is an integer number (60501056011009).
Almost surely, 2121002112022017 is an apocalyptic number.
It is an amenable number.
121002112022017 is a deficient number, since it is larger than the sum of its proper divisors (1).
121002112022017 is an equidigital number, since it uses as much as digits as its factorization.
121002112022017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 121002112022017 its reverse (710220211200121), we get a palindrome (831222323222138).
The spelling of 121002112022017 in words is "one hundred twenty-one trillion, two billion, one hundred twelve million, twenty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •