Base | Representation |
---|---|
bin | 111000011001010111… |
… | …0011100011010100101 |
3 | 102120121101001112222202 |
4 | 1300302232130122211 |
5 | 3441013142320401 |
6 | 131345350104245 |
7 | 11515136015105 |
oct | 1606256343245 |
9 | 376541045882 |
10 | 121110120101 |
11 | 473a9561853 |
12 | 1b57b64b085 |
13 | b56119c479 |
14 | 5c0c95b205 |
15 | 323c68a06b |
hex | 1c32b9c6a5 |
121110120101 has 2 divisors, whose sum is σ = 121110120102. Its totient is φ = 121110120100.
The previous prime is 121110120097. The next prime is 121110120113. The reversal of 121110120101 is 101021011121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119905683076 + 1204437025 = 346274^2 + 34705^2 .
It is a cyclic number.
It is not a de Polignac number, because 121110120101 - 22 = 121110120097 is a prime.
It is a super-2 number, since 2×1211101201012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121110120191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555060050 + 60555060051.
It is an arithmetic number, because the mean of its divisors is an integer number (60555060051).
Almost surely, 2121110120101 is an apocalyptic number.
It is an amenable number.
121110120101 is a deficient number, since it is larger than the sum of its proper divisors (1).
121110120101 is an equidigital number, since it uses as much as digits as its factorization.
121110120101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121110120101 its reverse (101021011121), we get a palindrome (222131131222).
The spelling of 121110120101 in words is "one hundred twenty-one billion, one hundred ten million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •