Base | Representation |
---|---|
bin | 10001011110100010011… |
… | …000011110110001110101 |
3 | 11020211001011101202011110 |
4 | 101132202120132301311 |
5 | 124134142132431401 |
6 | 2315424023025233 |
7 | 152525254164126 |
oct | 21364230366165 |
9 | 4224034352143 |
10 | 1201020202101 |
11 | 423393659025 |
12 | 17492329b219 |
13 | 89342a792a5 |
14 | 421b5c1404d |
15 | 2139455c9d6 |
hex | 117a261ec75 |
1201020202101 has 8 divisors (see below), whose sum is σ = 1640417837184. Its totient is φ = 781151350880.
The previous prime is 1201020202099. The next prime is 1201020202103. The reversal of 1201020202101 is 1012020201021.
It is an interprime number because it is at equal distance from previous prime (1201020202099) and next prime (1201020202103).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1201020202101 - 21 = 1201020202099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201020202103) 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, 4882195821 + ... + 4882196066.
It is an arithmetic number, because the mean of its divisors is an integer number (205052229648).
Almost surely, 21201020202101 is an apocalyptic number.
It is an amenable number.
1201020202101 is a deficient number, since it is larger than the sum of its proper divisors (439397635083).
1201020202101 is an equidigital number, since it uses as much as digits as its factorization.
1201020202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9764391931.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1201020202101 its reverse (1012020201021), we get a palindrome (2213040403122).
The spelling of 1201020202101 in words is "one trillion, two hundred one billion, twenty million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •