Base | Representation |
---|---|
bin | 11011100011101101001110… |
… | …101110110001110000111011 |
3 | 120220010200222021211101112022 |
4 | 123203231032232301300323 |
5 | 111341224123232324011 |
6 | 1105434545551305055 |
7 | 34346324561302001 |
oct | 3343551656616073 |
9 | 526120867741468 |
10 | 121201003011131 |
11 | 3568906955041a |
12 | 1171569681b18b |
13 | 5282289767294 |
14 | 21d023488aa71 |
15 | e02ab24198db |
hex | 6e3b4ebb1c3b |
121201003011131 has 8 divisors (see below), whose sum is σ = 121830635584944. Its totient is φ = 120571515882720.
The previous prime is 121201003011089. The next prime is 121201003011163. The reversal of 121201003011131 is 131110300102121.
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 121201003011131 - 234 = 121183823141947 is a prime.
It is a super-2 number, since 2×1212010030111312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121201003011331) 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, 34690205 + ... + 38023838.
It is an arithmetic number, because the mean of its divisors is an integer number (15228829448118).
Almost surely, 2121201003011131 is an apocalyptic number.
121201003011131 is a deficient number, since it is larger than the sum of its proper divisors (629632573813).
121201003011131 is an equidigital number, since it uses as much as digits as its factorization.
121201003011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72722701.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 121201003011131 its reverse (131110300102121), we get a palindrome (252311303113252).
The spelling of 121201003011131 in words is "one hundred twenty-one trillion, two hundred one billion, three million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •