Base | Representation |
---|---|
bin | 11011100011110110100010… |
… | …110110010110000001110011 |
3 | 120220011122210021212012121122 |
4 | 123203312202312112001303 |
5 | 111341410114034343121 |
6 | 1105443322220012455 |
7 | 34350130452160655 |
oct | 3343664266260163 |
9 | 526148707765548 |
10 | 121211004215411 |
11 | 35692330a08200 |
12 | 1171760809112b |
13 | 52831c1786936 |
14 | 21d0902c446d5 |
15 | e02e9a4645ab |
hex | 6e3da2d96073 |
121211004215411 has 12 divisors (see below), whose sum is σ = 136832793238176. Its totient is φ = 107213664658320.
The previous prime is 121211004215377. The next prime is 121211004215437. The reversal of 121211004215411 is 114512400112121.
It is a de Polignac number, because none of the positive numbers 2k-121211004215411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121211004215471) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13537074395 + ... + 13537083348.
It is an arithmetic number, because the mean of its divisors is an integer number (11402732769848).
Almost surely, 2121211004215411 is an apocalyptic number.
121211004215411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121211004215411 is a deficient number, since it is larger than the sum of its proper divisors (15621789022765).
121211004215411 is a wasteful number, since it uses less digits than its factorization.
121211004215411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27074157802 (or 27074157791 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 26.
Adding to 121211004215411 its reverse (114512400112121), we get a palindrome (235723404327532).
The spelling of 121211004215411 in words is "one hundred twenty-one trillion, two hundred eleven billion, four million, two hundred fifteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •