Base | Representation |
---|---|
bin | 11011100010010010010001… |
… | …000010000101001110001101 |
3 | 120212210100212100221020021111 |
4 | 123202102101002011032031 |
5 | 111333124110231320023 |
6 | 1105322034031532021 |
7 | 34336266304025644 |
oct | 3342222102051615 |
9 | 525710770836244 |
10 | 121103331120013 |
11 | 356506a8294a50 |
12 | 116ba77868a011 |
13 | 5275cc2391c78 |
14 | 21c960aad435b |
15 | e002977a500d |
hex | 6e249108538d |
121103331120013 has 16 divisors (see below), whose sum is σ = 132185711289600. Its totient is φ = 110033131622400.
The previous prime is 121103331120011. The next prime is 121103331120029. The reversal of 121103331120013 is 310021133301121.
It is a cyclic number.
It is not a de Polignac number, because 121103331120013 - 21 = 121103331120011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121103331120011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149885356 + ... + 150691162.
It is an arithmetic number, because the mean of its divisors is an integer number (8261606955600).
Almost surely, 2121103331120013 is an apocalyptic number.
It is an amenable number.
121103331120013 is a deficient number, since it is larger than the sum of its proper divisors (11082380169587).
121103331120013 is a wasteful number, since it uses less digits than its factorization.
121103331120013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813348.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 121103331120013 its reverse (310021133301121), we get a palindrome (431124464421134).
The spelling of 121103331120013 in words is "one hundred twenty-one trillion, one hundred three billion, three hundred thirty-one million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •