Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010100001111100110011001 |
3 | 222100200102011102200011120010 |
4 | 231230323312110033212121 |
5 | 202321141011034120441 |
6 | 1551254044125352133 |
7 | 60223525450245606 |
oct | 5554736624174631 |
9 | 870612142604503 |
10 | 201000012020121 |
11 | 590546987a9126 |
12 | 1a663195408649 |
13 | 88202b1ba5902 |
14 | 378c6498b96ad |
15 | 18387118cc116 |
hex | b6cef650f999 |
201000012020121 has 8 divisors (see below), whose sum is σ = 282105280028320. Its totient is φ = 126947376012672.
The previous prime is 201000012020117. The next prime is 201000012020207. The reversal of 201000012020121 is 121020210000102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201000012020121 - 22 = 201000012020117 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201000012020097 and 201000012020106.
It is not an unprimeable number, because it can be changed into a prime (201000012020321) 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, 1763158000120 + ... + 1763158000233.
It is an arithmetic number, because the mean of its divisors is an integer number (35263160003540).
Almost surely, 2201000012020121 is an apocalyptic number.
It is an amenable number.
201000012020121 is a deficient number, since it is larger than the sum of its proper divisors (81105268008199).
201000012020121 is a wasteful number, since it uses less digits than its factorization.
201000012020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3526316000375.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201000012020121 its reverse (121020210000102), we get a palindrome (322020222020223).
The spelling of 201000012020121 in words is "two hundred one trillion, twelve million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •