Base | Representation |
---|---|
bin | 11011100011110111100101… |
… | …011011000000010100110101 |
3 | 120220011202200010111221120002 |
4 | 123203313211123000110311 |
5 | 111341414411001401401 |
6 | 1105444025115121045 |
7 | 34350200233550462 |
oct | 3343674533002465 |
9 | 526152603457502 |
10 | 121212121122101 |
11 | 3569285441a789 |
12 | 1171787a143185 |
13 | 528333bca6a79 |
14 | 21d09ab304669 |
15 | e03013539a6b |
hex | 6e3de56c0535 |
121212121122101 has 2 divisors, whose sum is σ = 121212121122102. Its totient is φ = 121212121122100.
The previous prime is 121212121122073. The next prime is 121212121122133. The reversal of 121212121122101 is 101221121212121.
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., 121098029847025 + 114091275076 = 11004455^2 + 337774^2 .
It is a cyclic number.
It is not a de Polignac number, because 121212121122101 - 218 = 121212120859957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121212121122601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60606060561050 + 60606060561051.
It is an arithmetic number, because the mean of its divisors is an integer number (60606060561051).
Almost surely, 2121212121122101 is an apocalyptic number.
It is an amenable number.
121212121122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
121212121122101 is an equidigital number, since it uses as much as digits as its factorization.
121212121122101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 121212121122101 its reverse (101221121212121), we get a palindrome (222433242334222).
The spelling of 121212121122101 in words is "one hundred twenty-one trillion, two hundred twelve billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •