Base | Representation |
---|---|
bin | 101101101110101100100010… |
… | …010111101101110010110101 |
3 | 222101002222111000010011220221 |
4 | 231232230202113231302311 |
5 | 202330131312103241041 |
6 | 1551425414440454341 |
7 | 60235341060021514 |
oct | 5556544227556265 |
9 | 871088430104827 |
10 | 201121010212021 |
11 | 590a0a3a061629 |
12 | 1a68272347a3b1 |
13 | 882b825b16173 |
14 | 379444761c67b |
15 | 183b9443082d1 |
hex | b6eb225edcb5 |
201121010212021 has 16 divisors (see below), whose sum is σ = 208593169334784. Its totient is φ = 193803985787904.
The previous prime is 201121010212019. The next prime is 201121010212037. The reversal of 201121010212021 is 120212010121102.
It is a cyclic number.
It is not a de Polignac number, because 201121010212021 - 21 = 201121010212019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201121010211986 and 201121010212004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121010212091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119235756 + ... + 120910741.
It is an arithmetic number, because the mean of its divisors is an integer number (13037073083424).
Almost surely, 2201121010212021 is an apocalyptic number.
It is an amenable number.
201121010212021 is a deficient number, since it is larger than the sum of its proper divisors (7472159122763).
201121010212021 is a wasteful number, since it uses less digits than its factorization.
201121010212021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240146820.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201121010212021 its reverse (120212010121102), we get a palindrome (321333020333123).
The spelling of 201121010212021 in words is "two hundred one trillion, one hundred twenty-one billion, ten million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •