Base | Representation |
---|---|
bin | 11011010011101100110010… |
… | …101001010111010000011011 |
3 | 120202020112201121010000020211 |
4 | 123103230302221113100123 |
5 | 111220213342132431021 |
6 | 1103233351430231551 |
7 | 34204004145553432 |
oct | 3323546251272033 |
9 | 522215647100224 |
10 | 120101020202011 |
11 | 352a4613971172 |
12 | 115784707b55b7 |
13 | 52026293ca934 |
14 | 2192cc57ba119 |
15 | dd41832123e1 |
hex | 6d3b32a5741b |
120101020202011 has 4 divisors (see below), whose sum is σ = 120118778750872. Its totient is φ = 120083261653152.
The previous prime is 120101020201969. The next prime is 120101020202021. The reversal of 120101020202011 is 110202020101021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120101020202011 - 29 = 120101020201499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120101020201982 and 120101020202000.
It is not an unprimeable number, because it can be changed into a prime (120101020202021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8879264286 + ... + 8879277811.
It is an arithmetic number, because the mean of its divisors is an integer number (30029694687718).
Almost surely, 2120101020202011 is an apocalyptic number.
120101020202011 is a deficient number, since it is larger than the sum of its proper divisors (17758548861).
120101020202011 is an equidigital number, since it uses as much as digits as its factorization.
120101020202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17758548860.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120101020202011 its reverse (110202020101021), we get a palindrome (230303040303032).
The spelling of 120101020202011 in words is "one hundred twenty trillion, one hundred one billion, twenty million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •