Base | Representation |
---|---|
bin | 11011010011111110011110… |
… | …000011111110100101001001 |
3 | 120202022100201111002221011020 |
4 | 123103332132003332211021 |
5 | 111221021231031210441 |
6 | 1103250211152423053 |
7 | 34205245430143104 |
oct | 3323763603764511 |
9 | 522270644087136 |
10 | 120120002210121 |
11 | 353016747a8881 |
12 | 11580089847a89 |
13 | 5204362c08cb4 |
14 | 2193ba67cd73b |
15 | dd48e48e5e66 |
hex | 6d3f9e0fe949 |
120120002210121 has 8 divisors (see below), whose sum is σ = 160219343455200. Its totient is φ = 80050331219232.
The previous prime is 120120002210059. The next prime is 120120002210171. The reversal of 120120002210121 is 121012200021021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120120002210121 - 27 = 120120002209993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120120002210121.
It is not an unprimeable number, because it can be changed into a prime (120120002210171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7417554100 + ... + 7417570293.
It is an arithmetic number, because the mean of its divisors is an integer number (20027417931900).
Almost surely, 2120120002210121 is an apocalyptic number.
It is an amenable number.
120120002210121 is a deficient number, since it is larger than the sum of its proper divisors (40099341245079).
120120002210121 is a wasteful number, since it uses less digits than its factorization.
120120002210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14835127095.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120120002210121 its reverse (121012200021021), we get a palindrome (241132202231142).
The spelling of 120120002210121 in words is "one hundred twenty trillion, one hundred twenty billion, two million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •