Base | Representation |
---|---|
bin | 11011010011101100111101… |
… | …011111010100110101000001 |
3 | 120202020120012021102101211011 |
4 | 123103230331133110311001 |
5 | 111220214230220320001 |
6 | 1103233421445320521 |
7 | 34204011515050534 |
oct | 3323547537246501 |
9 | 522216167371734 |
10 | 120101202120001 |
11 | 352a46a7623913 |
12 | 11578501706141 |
13 | 5202657cc380b |
14 | 2192d01a12a1b |
15 | dd4194198d51 |
hex | 6d3b3d7d4d41 |
120101202120001 has 4 divisors (see below), whose sum is σ = 120102932679472. Its totient is φ = 120099471560532.
The previous prime is 120101202119933. The next prime is 120101202120017. The reversal of 120101202120001 is 100021202101021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120101202120001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120101202126001) 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, 865175631 + ... + 865314436.
It is an arithmetic number, because the mean of its divisors is an integer number (30025733169868).
Almost surely, 2120101202120001 is an apocalyptic number.
It is an amenable number.
120101202120001 is a deficient number, since it is larger than the sum of its proper divisors (1730559471).
120101202120001 is an equidigital number, since it uses as much as digits as its factorization.
120101202120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1730559470.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120101202120001 its reverse (100021202101021), we get a palindrome (220122404221022).
The spelling of 120101202120001 in words is "one hundred twenty trillion, one hundred one billion, two hundred two million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •