Base | Representation |
---|---|
bin | 111000010110101011… |
… | …0101111010110011001 |
3 | 102120101002112000001110 |
4 | 1300231112233112121 |
5 | 3440322111120441 |
6 | 131332411010533 |
7 | 11512663125000 |
oct | 1605526572631 |
9 | 376332460043 |
10 | 121020020121 |
11 | 47362712360 |
12 | 1b555439a49 |
13 | b548613b80 |
14 | 5c009c5c37 |
15 | 32347ddb16 |
hex | 1c2d5af599 |
121020020121 has 256 divisors, whose sum is σ = 236888064000. Its totient is φ = 53964288000.
The previous prime is 121020020113. The next prime is 121020020167.
121020020121 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 121020020121 - 23 = 121020020113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121020020097 and 121020020106.
It is not an unprimeable number, because it can be changed into a prime (121020000121) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 252651160 + ... + 252651638.
It is an arithmetic number, because the mean of its divisors is an integer number (925344000).
Almost surely, 2121020020121 is an apocalyptic number.
121020020121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121020020121 is a deficient number, since it is larger than the sum of its proper divisors (115868043879).
121020020121 is a wasteful number, since it uses less digits than its factorization.
121020020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645 (or 631 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 1210200 and 20121, that added together give a palindrome (1230321).
The spelling of 121020020121 in words is "one hundred twenty-one billion, twenty million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •