Base | Representation |
---|---|
bin | 11101011011100000101… |
… | …01100101001101111101 |
3 | 10120200002102000000100212 |
4 | 32231300111211031331 |
5 | 113031420204121341 |
6 | 2052312332402205 |
7 | 133025346232061 |
oct | 16556025451575 |
9 | 3520072000325 |
10 | 1011202020221 |
11 | 35a9371a6548 |
12 | 143b89616365 |
13 | 74482006b83 |
14 | 36d2a0a3aa1 |
15 | 1b484e0d5eb |
hex | eb7056537d |
1011202020221 has 32 divisors (see below), whose sum is σ = 1120126233600. Its totient is φ = 908566813440.
The previous prime is 1011202020203. The next prime is 1011202020223. The reversal of 1011202020221 is 1220202021101.
It is a cyclic number.
It is not a de Polignac number, because 1011202020221 - 214 = 1011202003837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011202020196 and 1011202020205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011202020223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74242550 + ... + 74256168.
It is an arithmetic number, because the mean of its divisors is an integer number (35003944800).
Almost surely, 21011202020221 is an apocalyptic number.
It is an amenable number.
1011202020221 is a deficient number, since it is larger than the sum of its proper divisors (108924213379).
1011202020221 is a wasteful number, since it uses less digits than its factorization.
1011202020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15089.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1011202020221 its reverse (1220202021101), we get a palindrome (2231404041322).
The spelling of 1011202020221 in words is "one trillion, eleven billion, two hundred two million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •