Base | Representation |
---|---|
bin | 11011100010010000001101… |
… | …110110010100000111101101 |
3 | 120212210011011222112221001200 |
4 | 123202100031312110013231 |
5 | 111333110103314020023 |
6 | 1105321031411000113 |
7 | 34336160620500606 |
oct | 3342201566240755 |
9 | 525704158487050 |
10 | 121101130220013 |
11 | 3564a778a00229 |
12 | 116ba263599039 |
13 | 5275a31406a88 |
14 | 21c947c6a0dad |
15 | e001b945b743 |
hex | 6e240dd941ed |
121101130220013 has 12 divisors (see below), whose sum is σ = 174968444121120. Its totient is φ = 80713507109256.
The previous prime is 121101130219967. The next prime is 121101130220017. The reversal of 121101130220013 is 310022031101121.
It is not a de Polignac number, because 121101130220013 - 210 = 121101130218989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121101130220017) 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 11 ways as a sum of consecutive naturals, for example, 1714938073 + ... + 1715008686.
It is an arithmetic number, because the mean of its divisors is an integer number (14580703676760).
Almost surely, 2121101130220013 is an apocalyptic number.
It is an amenable number.
121101130220013 is a deficient number, since it is larger than the sum of its proper divisors (53867313901107).
121101130220013 is a wasteful number, since it uses less digits than its factorization.
121101130220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3429950688 (or 3429950685 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 121101130220013 its reverse (310022031101121), we get a palindrome (431123161321134).
The spelling of 121101130220013 in words is "one hundred twenty-one trillion, one hundred one billion, one hundred thirty million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •