Base | Representation |
---|---|
bin | 11101101110001010111… |
… | …01100100001100010001 |
3 | 10121121221120210202112120 |
4 | 32313011131210030101 |
5 | 113212424322023441 |
6 | 2101050403044453 |
7 | 133531533502140 |
oct | 16670535441421 |
9 | 3547846722476 |
10 | 1021220111121 |
11 | 364108147511 |
12 | 145b04670729 |
13 | 753ba689802 |
14 | 375da7b5757 |
15 | 1b86e691966 |
hex | edc5764311 |
1021220111121 has 32 divisors (see below), whose sum is σ = 1558106312448. Its totient is φ = 582819287040.
The previous prime is 1021220111111. The next prime is 1021220111123. The reversal of 1021220111121 is 1211110221201.
It is a happy number.
1021220111121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1021220111121 - 25 = 1021220111089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1021220111121.
It is not an unprimeable number, because it can be changed into a prime (1021220111123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67350781 + ... + 67365941.
It is an arithmetic number, because the mean of its divisors is an integer number (48690822264).
Almost surely, 21021220111121 is an apocalyptic number.
It is an amenable number.
1021220111121 is a deficient number, since it is larger than the sum of its proper divisors (536886201327).
1021220111121 is a wasteful number, since it uses less digits than its factorization.
1021220111121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19001.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1021220111121 its reverse (1211110221201), we get a palindrome (2232330332322).
The spelling of 1021220111121 in words is "one trillion, twenty-one billion, two hundred twenty million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •