Base | Representation |
---|---|
bin | 101101101110011001111111… |
… | …101000101101000100101001 |
3 | 222101001002002102202012200110 |
4 | 231232121333220231010221 |
5 | 202324320023112010441 |
6 | 1551412323042124533 |
7 | 60234034505654301 |
oct | 5556317750550451 |
9 | 871032072665613 |
10 | 201101100110121 |
11 | 59093552354362 |
12 | 1a67a8a7650749 |
13 | 88299a1c55c93 |
14 | 37934b9258601 |
15 | 183b17b3e8b16 |
hex | b6e67fa2d129 |
201101100110121 has 8 divisors (see below), whose sum is σ = 268135704658944. Its totient is φ = 134066947817360.
The previous prime is 201101100110059. The next prime is 201101100110143. The reversal of 201101100110121 is 121011001101102.
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 201101100110121 - 213 = 201101100101929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201101100110097 and 201101100110106.
It is not an unprimeable number, because it can be changed into a prime (201101100110171) 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, 112025106 + ... + 113806091.
It is an arithmetic number, because the mean of its divisors is an integer number (33516963082368).
Almost surely, 2201101100110121 is an apocalyptic number.
It is an amenable number.
201101100110121 is a deficient number, since it is larger than the sum of its proper divisors (67034604548823).
201101100110121 is a wasteful number, since it uses less digits than its factorization.
201101100110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226128031.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 201101100110121 its reverse (121011001101102), we get a palindrome (322112101211223).
The spelling of 201101100110121 in words is "two hundred one trillion, one hundred one billion, one hundred million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •