Base | Representation |
---|---|
bin | 11011010011111111011010… |
… | …001100001111110111001101 |
3 | 120202022110022210100022211112 |
4 | 123103333122030033313031 |
5 | 111221030312304323041 |
6 | 1103250455230501405 |
7 | 34205312426620436 |
oct | 3323773214176715 |
9 | 522273283308745 |
10 | 120121011011021 |
11 | 35302042192929 |
12 | 1158030b664865 |
13 | 5204493c07cc7 |
14 | 2193c6078c48d |
15 | dd4953264deb |
hex | 6d3fda30fdcd |
120121011011021 has 16 divisors (see below), whose sum is σ = 120741750803520. Its totient is φ = 119501308903680.
The previous prime is 120121011010967. The next prime is 120121011011093. The reversal of 120121011011021 is 120110110121021.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120121011011021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120121011010987 and 120121011011005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120121010011021) 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, 2674742315 + ... + 2674787223.
It is an arithmetic number, because the mean of its divisors is an integer number (7546359425220).
Almost surely, 2120121011011021 is an apocalyptic number.
It is an amenable number.
120121011011021 is a deficient number, since it is larger than the sum of its proper divisors (620739792499).
120121011011021 is a wasteful number, since it uses less digits than its factorization.
120121011011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56156.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 120121011011021 its reverse (120110110121021), we get a palindrome (240231121132042).
The spelling of 120121011011021 in words is "one hundred twenty trillion, one hundred twenty-one billion, eleven million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •