Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …110110010010010011101101 |
3 | 222101001002101212102200201021 |
4 | 231232122012312102103231 |
5 | 202324320300101023041 |
6 | 1551412343043414141 |
7 | 60234040505314510 |
oct | 5556320666222355 |
9 | 871032355380637 |
10 | 201101221111021 |
11 | 5909360468a100 |
12 | 1a67a920084351 |
13 | 88299c104064a |
14 | 37934cb354d77 |
15 | 183b186d4acd1 |
hex | b6e686d924ed |
201101221111021 has 24 divisors (see below), whose sum is σ = 254172856223552. Its totient is φ = 155740886611200.
The previous prime is 201101221110901. The next prime is 201101221111067. The reversal of 201101221111021 is 120111122101102.
It is not a de Polignac number, because 201101221111021 - 211 = 201101221108973 is a prime.
It is a super-2 number, since 2×2011012211110212 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201101221110986 and 201101221111004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101221111321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 728167620 + ... + 728443741.
Almost surely, 2201101221111021 is an apocalyptic number.
It is an amenable number.
201101221111021 is a deficient number, since it is larger than the sum of its proper divisors (53071635112531).
201101221111021 is a wasteful number, since it uses less digits than its factorization.
201101221111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1456611553 (or 1456611542 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 201101221111021 its reverse (120111122101102), we get a palindrome (321212343212123).
The spelling of 201101221111021 in words is "two hundred one trillion, one hundred one billion, two hundred twenty-one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •