Base | Representation |
---|---|
bin | 11011100011101101001110… |
… | …100111000110110010111001 |
3 | 120220010200222011001012221110 |
4 | 123203231032213012302321 |
5 | 111341224122224000441 |
6 | 1105434545440230533 |
7 | 34346324535225000 |
oct | 3343551647066271 |
9 | 526120864035843 |
10 | 121201001000121 |
11 | 356890683a7529 |
12 | 1171569600b449 |
13 | 5282289211b33 |
14 | 21d02344c5c37 |
15 | e02ab216db16 |
hex | 6e3b4e9c6cb9 |
121201001000121 has 48 divisors (see below), whose sum is σ = 193687444406400. Its totient is φ = 67385883942720.
The previous prime is 121201001000119. The next prime is 121201001000159. The reversal of 121201001000121 is 121000100102121.
It is not a de Polignac number, because 121201001000121 - 21 = 121201001000119 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121201001000097 and 121201001000106.
It is not an unprimeable number, because it can be changed into a prime (121201001000171) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 41610010 + ... + 44427411.
It is an arithmetic number, because the mean of its divisors is an integer number (4035155091800).
Almost surely, 2121201001000121 is an apocalyptic number.
It is an amenable number.
121201001000121 is a deficient number, since it is larger than the sum of its proper divisors (72486443406279).
121201001000121 is an frugal number, since it uses more digits than its factorization.
121201001000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86037519 (or 86037468 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121201001000121 its reverse (121000100102121), we get a palindrome (242201101102242).
The spelling of 121201001000121 in words is "one hundred twenty-one trillion, two hundred one billion, one million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •