Base | Representation |
---|---|
bin | 101101101100111011111100… |
… | …110000100111101100001001 |
3 | 222100200102102222002022121220 |
4 | 231230323330300213230021 |
5 | 202321141221222401441 |
6 | 1551254102550352253 |
7 | 60223531232144025 |
oct | 5554737460475411 |
9 | 870612388068556 |
10 | 201000120122121 |
11 | 59054743823821 |
12 | 1a66320565b689 |
13 | 88202cb3c50a8 |
14 | 378c659db9385 |
15 | 183871b132466 |
hex | b6cefcc27b09 |
201000120122121 has 8 divisors (see below), whose sum is σ = 268281377543520. Its totient is φ = 133859471391072.
The previous prime is 201000120122093. The next prime is 201000120122147. The reversal of 201000120122121 is 121221021000102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201000120122121 - 218 = 201000119859977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201000120122121.
It is not an unprimeable number, because it can be changed into a prime (201000120122161) 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, 35152169251 + ... + 35152174968.
It is an arithmetic number, because the mean of its divisors is an integer number (33535172192940).
Almost surely, 2201000120122121 is an apocalyptic number.
It is an amenable number.
201000120122121 is a deficient number, since it is larger than the sum of its proper divisors (67281257421399).
201000120122121 is an equidigital number, since it uses as much as digits as its factorization.
201000120122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70304345175.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201000120122121 its reverse (121221021000102), we get a palindrome (322221141122223).
The spelling of 201000120122121 in words is "two hundred one trillion, one hundred twenty million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •