Base | Representation |
---|---|
bin | 11011100011101100010011… |
… | …000001001111111000011001 |
3 | 120220010121101110210010121120 |
4 | 123203230103001033320121 |
5 | 111341220100303020441 |
6 | 1105434302323355453 |
7 | 34346261005231335 |
oct | 3343542301177031 |
9 | 526117343703546 |
10 | 121200001220121 |
11 | 356886a5013a6a |
12 | 11715457222b89 |
13 | 528215a050b35 |
14 | 21d017b7d47c5 |
15 | e02a544d2966 |
hex | 6e3b1304fe19 |
121200001220121 has 8 divisors (see below), whose sum is σ = 161657043643680. Its totient is φ = 80771479804992.
The previous prime is 121200001220059. The next prime is 121200001220273. The reversal of 121200001220121 is 121022100002121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121200001220121 - 210 = 121200001219097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121200001220121.
It is not an unprimeable number, because it can be changed into a prime (121200001221121) 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, 7130242191 + ... + 7130259188.
It is an arithmetic number, because the mean of its divisors is an integer number (20207130455460).
Almost surely, 2121200001220121 is an apocalyptic number.
It is an amenable number.
121200001220121 is a deficient number, since it is larger than the sum of its proper divisors (40457042423559).
121200001220121 is a wasteful number, since it uses less digits than its factorization.
121200001220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14260504215.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121200001220121 its reverse (121022100002121), we get a palindrome (242222101222242).
The spelling of 121200001220121 in words is "one hundred twenty-one trillion, two hundred billion, one million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •