Base | Representation |
---|---|
bin | 11101011011100000100… |
… | …10000101000010111011 |
3 | 10120200002100021100211002 |
4 | 32231300102011002323 |
5 | 113031414440231021 |
6 | 2052312300555215 |
7 | 133025335356062 |
oct | 16556022050273 |
9 | 3520070240732 |
10 | 1011201102011 |
11 | 35a9367296a1 |
12 | 143b89252b0b |
13 | 74481a74c59 |
14 | 36d29d051d9 |
15 | 1b484ccb50b |
hex | eb704850bb |
1011201102011 has 4 divisors (see below), whose sum is σ = 1028340103800. Its totient is φ = 994062100224.
The previous prime is 1011201102007. The next prime is 1011201102029. The reversal of 1011201102011 is 1102011021101.
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 1011201102011 - 22 = 1011201102007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011201101983 and 1011201102001.
It is not an unprimeable number, because it can be changed into a prime (1011201102031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8569500806 + ... + 8569500923.
It is an arithmetic number, because the mean of its divisors is an integer number (257085025950).
Almost surely, 21011201102011 is an apocalyptic number.
1011201102011 is a deficient number, since it is larger than the sum of its proper divisors (17139001789).
1011201102011 is an equidigital number, since it uses as much as digits as its factorization.
1011201102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17139001788.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011201102011 its reverse (1102011021101), we get a palindrome (2113212123112).
The spelling of 1011201102011 in words is "one trillion, eleven billion, two hundred one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •