Base | Representation |
---|---|
bin | 11011100101011100001010… |
… | …001111101101010011110100 |
3 | 120220120002102021110211110222 |
4 | 123211130022033231103310 |
5 | 111400202042423200040 |
6 | 1110005405054033512 |
7 | 34361042333325242 |
oct | 3345341217552364 |
9 | 526502367424428 |
10 | 121320113100020 |
11 | 3572463104410a |
12 | 117347984a8898 |
13 | 529058c47b113 |
14 | 21d5cd3941792 |
15 | e05c341d7bb5 |
hex | 6e570a3ed4f4 |
121320113100020 has 48 divisors (see below), whose sum is σ = 257824957824000. Its totient is φ = 47949985092480.
The previous prime is 121320113099989. The next prime is 121320113100029. The reversal of 121320113100020 is 20001311023121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121320113100029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106005290 + ... + 107143649.
It is an arithmetic number, because the mean of its divisors is an integer number (5371353288000).
Almost surely, 2121320113100020 is an apocalyptic number.
121320113100020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121320113100020 is an abundant number, since it is smaller than the sum of its proper divisors (136504844723980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121320113100020 is a wasteful number, since it uses less digits than its factorization.
121320113100020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213149288 (or 213149286 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121320113100020 its reverse (20001311023121), we get a palindrome (141321424123141).
The spelling of 121320113100020 in words is "one hundred twenty-one trillion, three hundred twenty billion, one hundred thirteen million, one hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •