Base | Representation |
---|---|
bin | 11101101110001000101… |
… | …00101111110000111011 |
3 | 10121121220020212221012111 |
4 | 32313010110233300323 |
5 | 113212404430201021 |
6 | 2101044441553151 |
7 | 133531212315562 |
oct | 16670424576073 |
9 | 3547806787174 |
10 | 1021201022011 |
11 | 3640a8399595 |
12 | 145aba1a57b7 |
13 | 753b6734b91 |
14 | 375d8046bd9 |
15 | 1b86cb708e1 |
hex | edc452fc3b |
1021201022011 has 4 divisors (see below), whose sum is σ = 1044949883032. Its totient is φ = 997452160992.
The previous prime is 1021201021991. The next prime is 1021201022099. The reversal of 1021201022011 is 1102201021201.
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 1021201022011 - 25 = 1021201021979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021201021982 and 1021201022000.
It is not an unprimeable number, because it can be changed into a prime (1021601022011) 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, 11874430446 + ... + 11874430531.
It is an arithmetic number, because the mean of its divisors is an integer number (261237470758).
Almost surely, 21021201022011 is an apocalyptic number.
1021201022011 is a deficient number, since it is larger than the sum of its proper divisors (23748861021).
1021201022011 is an equidigital number, since it uses as much as digits as its factorization.
1021201022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23748861020.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1021201022011 its reverse (1102201021201), we get a palindrome (2123402043212).
The spelling of 1021201022011 in words is "one trillion, twenty-one billion, two hundred one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •