Base | Representation |
---|---|
bin | 101101101110101100100111… |
… | …110010110100001001100101 |
3 | 222101002222201100022221201221 |
4 | 231232230213302310021211 |
5 | 202330132003401431041 |
6 | 1551425431451020341 |
7 | 60235343243306500 |
oct | 5556544762641145 |
9 | 871088640287657 |
10 | 201121101202021 |
11 | 590a0a86459780 |
12 | 1a682749a3a6b1 |
13 | 882b83b9238c0 |
14 | 3794455746137 |
15 | 183b94c2cd2d1 |
hex | b6eb27cb4265 |
201121101202021 has 24 divisors (see below), whose sum is σ = 274858807646304. Its totient is φ = 144662530330080.
The previous prime is 201121101202013. The next prime is 201121101202027. The reversal of 201121101202021 is 120202101121102.
It is not a de Polignac number, because 201121101202021 - 23 = 201121101202013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201121101201986 and 201121101202004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121101202027) 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, 14351434495 + ... + 14351448508.
It is an arithmetic number, because the mean of its divisors is an integer number (11452450318596).
Almost surely, 2201121101202021 is an apocalyptic number.
It is an amenable number.
201121101202021 is a deficient number, since it is larger than the sum of its proper divisors (73737706444283).
201121101202021 is a wasteful number, since it uses less digits than its factorization.
201121101202021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28702883041 (or 28702883034 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201121101202021 its reverse (120202101121102), we get a palindrome (321323202323123).
The spelling of 201121101202021 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred one million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •