Base | Representation |
---|---|
bin | 11011100010100010111011… |
… | …010011001101010111110101 |
3 | 120212212002001002020200210101 |
4 | 123202202323103031113311 |
5 | 111333422224322401401 |
6 | 1105334153111154101 |
7 | 34340501514031663 |
oct | 3342427323152765 |
9 | 525762032220711 |
10 | 121121220122101 |
11 | 35658248153aa1 |
12 | 1170212b675931 |
13 | 52778b35cabc4 |
14 | 21ca4268a9c33 |
15 | e00993035101 |
hex | 6e28bb4cd5f5 |
121121220122101 has 8 divisors (see below), whose sum is σ = 125033772524544. Its totient is φ = 117209006236560.
The previous prime is 121121220122027. The next prime is 121121220122113. The reversal of 121121220122101 is 101221022121121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121121220122101 - 219 = 121121219597813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121121220162101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83901970 + ... + 85333363.
It is an arithmetic number, because the mean of its divisors is an integer number (15629221565568).
Almost surely, 2121121220122101 is an apocalyptic number.
It is an amenable number.
121121220122101 is a deficient number, since it is larger than the sum of its proper divisors (3912552402443).
121121220122101 is a wasteful number, since it uses less digits than its factorization.
121121220122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169258451.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121121220122101 its reverse (101221022121121), we get a palindrome (222342242243222).
The spelling of 121121220122101 in words is "one hundred twenty-one trillion, one hundred twenty-one billion, two hundred twenty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •