Base | Representation |
---|---|
bin | 11101101110001011000… |
… | …01010101110111010011 |
3 | 10121121221122200001102011 |
4 | 32313011201111313103 |
5 | 113212430100213021 |
6 | 2101050440203351 |
7 | 133531545064126 |
oct | 16670541256723 |
9 | 3547848601364 |
10 | 1021221101011 |
11 | 364108763201 |
12 | 145b04a69557 |
13 | 753ba945247 |
14 | 375da9923bd |
15 | 1b86e7d9de1 |
hex | edc5855dd3 |
1021221101011 has 4 divisors (see below), whose sum is σ = 1021246987024. Its totient is φ = 1021195215000.
The previous prime is 1021221101003. The next prime is 1021221101203. The reversal of 1021221101011 is 1101011221201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1021221101011 - 23 = 1021221101003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021221100982 and 1021221101000.
It is not an unprimeable number, because it can be changed into a prime (1021221101311) 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 3 ways as a sum of consecutive naturals, for example, 12883740 + ... + 12962761.
It is an arithmetic number, because the mean of its divisors is an integer number (255311746756).
Almost surely, 21021221101011 is an apocalyptic number.
1021221101011 is a deficient number, since it is larger than the sum of its proper divisors (25886013).
1021221101011 is an equidigital number, since it uses as much as digits as its factorization.
1021221101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25886012.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1021221101011 its reverse (1101011221201), we get a palindrome (2122232322212).
The spelling of 1021221101011 in words is "one trillion, twenty-one billion, two hundred twenty-one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •