Base | Representation |
---|---|
bin | 101101101110101011100110… |
… | …010010000101001101101001 |
3 | 222101002212212202011220010020 |
4 | 231232223212102011031221 |
5 | 202330122231014231441 |
6 | 1551425130425311053 |
7 | 60235304066152554 |
oct | 5556534622051551 |
9 | 871085782156106 |
10 | 201120002102121 |
11 | 590a0571aa9753 |
12 | 1a6824a1935489 |
13 | 882b6c4cc982b |
14 | 379438d79d69b |
15 | 183b8d5a73e66 |
hex | b6eae6485369 |
201120002102121 has 8 divisors (see below), whose sum is σ = 268171845847200. Its totient is φ = 134074079879232.
The previous prime is 201120002102113. The next prime is 201120002102141. The reversal of 201120002102121 is 121201200021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201120002102121 - 23 = 201120002102113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201120002102121.
It is not an unprimeable number, because it can be changed into a prime (201120002102141) 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, 1480301296 + ... + 1480437153.
It is an arithmetic number, because the mean of its divisors is an integer number (33521480730900).
Almost surely, 2201120002102121 is an apocalyptic number.
It is an amenable number.
201120002102121 is a deficient number, since it is larger than the sum of its proper divisors (67051843745079).
201120002102121 is a wasteful number, since it uses less digits than its factorization.
201120002102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2960761095.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201120002102121 its reverse (121201200021102), we get a palindrome (322321202123223).
The spelling of 201120002102121 in words is "two hundred one trillion, one hundred twenty billion, two million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •