Base | Representation |
---|---|
bin | 1010000000110111011110… |
… | …1111110011110000100010 |
3 | 1102222112202112121120202010 |
4 | 2200031313233303300202 |
5 | 2420342000102413442 |
6 | 35225532344533350 |
7 | 2214306213403212 |
oct | 240156757636042 |
9 | 42875675546663 |
10 | 11010010201122 |
11 | 35653568011a9 |
12 | 1299992181256 |
13 | 61b31627379a |
14 | 2a0c5cbd2242 |
15 | 1415e03ceb9c |
hex | a0377bf3c22 |
11010010201122 has 32 divisors (see below), whose sum is σ = 22261266132480. Its totient is φ = 3629931388160.
The previous prime is 11010010201081. The next prime is 11010010201207. The reversal of 11010010201122 is 22110201001011.
It is a junction number, because it is equal to n+sod(n) for n = 11010010201098 and 11010010201107.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 16626129 + ... + 17275652.
It is an arithmetic number, because the mean of its divisors is an integer number (695664566640).
Almost surely, 211010010201122 is an apocalyptic number.
11010010201122 is an abundant number, since it is smaller than the sum of its proper divisors (11251255931358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010010201122 is a wasteful number, since it uses less digits than its factorization.
11010010201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33902378.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11010010201122 its reverse (22110201001011), we get a palindrome (33120211202133).
The spelling of 11010010201122 in words is "eleven trillion, ten billion, ten million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •