Base | Representation |
---|---|
bin | 11011100101001100100000… |
… | …000111111110000100111001 |
3 | 120220111111000120020011012011 |
4 | 123211030200013332010321 |
5 | 111344413124334113423 |
6 | 1105553544501245521 |
7 | 34356605602023640 |
oct | 3345144007760471 |
9 | 526444016204164 |
10 | 121303300301113 |
11 | 35718493716487 |
12 | 11731485a038a1 |
13 | 528bb101b04b8 |
14 | 21d517aa72357 |
15 | e0559d18cb0d |
hex | 6e53201fe139 |
121303300301113 has 32 divisors (see below), whose sum is σ = 146086566912000. Its totient is φ = 98473054686336.
The previous prime is 121303300301111. The next prime is 121303300301137. The reversal of 121303300301113 is 311103003303121.
It is a cyclic number.
It is not a de Polignac number, because 121303300301113 - 21 = 121303300301111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121303300301111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108876973 + ... + 109985461.
It is an arithmetic number, because the mean of its divisors is an integer number (4565205216000).
Almost surely, 2121303300301113 is an apocalyptic number.
It is an amenable number.
121303300301113 is a deficient number, since it is larger than the sum of its proper divisors (24783266610887).
121303300301113 is a wasteful number, since it uses less digits than its factorization.
121303300301113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115221.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 121303300301113 its reverse (311103003303121), we get a palindrome (432406303604234).
The spelling of 121303300301113 in words is "one hundred twenty-one trillion, three hundred three billion, three hundred million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •