Base | Representation |
---|---|
bin | 11011100001011000011001… |
… | …110110010110010011100011 |
3 | 120212120102111111001121100012 |
4 | 123201120121312112103203 |
5 | 111331114340203412121 |
6 | 1105233321025315135 |
7 | 34331636552236241 |
oct | 3341303166262343 |
9 | 525512444047305 |
10 | 121041202013411 |
11 | 35627315aa9659 |
12 | 116aa719795aab |
13 | 52701a07c57b4 |
14 | 21c65d5579791 |
15 | ded85d18ac5b |
hex | 6e1619d964e3 |
121041202013411 has 4 divisors (see below), whose sum is σ = 121150346470800. Its totient is φ = 120932057556024.
The previous prime is 121041202013399. The next prime is 121041202013443. The reversal of 121041202013411 is 114310202140121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121041202013411 is a prime.
It is a super-2 number, since 2×1210412020134112 (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 (121041202013471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54572227031 + ... + 54572229248.
It is an arithmetic number, because the mean of its divisors is an integer number (30287586617700).
Almost surely, 2121041202013411 is an apocalyptic number.
121041202013411 is a deficient number, since it is larger than the sum of its proper divisors (109144457389).
121041202013411 is a wasteful number, since it uses less digits than its factorization.
121041202013411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109144457388.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 121041202013411 its reverse (114310202140121), we get a palindrome (235351404153532).
The spelling of 121041202013411 in words is "one hundred twenty-one trillion, forty-one billion, two hundred two million, thirteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •