Base | Representation |
---|---|
bin | 1010001100100000111100… |
… | …1110111000001100110011 |
3 | 1110200200021112212211201111 |
4 | 2203020033032320030303 |
5 | 2432131311232413021 |
6 | 35501505204414151 |
7 | 2234622141341464 |
oct | 243101716701463 |
9 | 43620245784644 |
10 | 11210120201011 |
11 | 36322046739a6 |
12 | 131071a6a7357 |
13 | 6341572c7c44 |
14 | 2aa803748d6b |
15 | 1469033318e1 |
hex | a320f3b8333 |
11210120201011 has 16 divisors (see below), whose sum is σ = 12000780979200. Its totient is φ = 10440678800448.
The previous prime is 11210120200999. The next prime is 11210120201047. The reversal of 11210120201011 is 11010202101211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11210120201011 - 227 = 11209985983283 is a prime.
It is a super-2 number, since 2×112101202010112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11210120200982 and 11210120201000.
It is not an unprimeable number, because it can be changed into a prime (11210120201411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15676951 + ... + 16376416.
It is an arithmetic number, because the mean of its divisors is an integer number (750048811200).
Almost surely, 211210120201011 is an apocalyptic number.
11210120201011 is a deficient number, since it is larger than the sum of its proper divisors (790660778189).
11210120201011 is a wasteful number, since it uses less digits than its factorization.
11210120201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32053698.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11210120201011 its reverse (11010202101211), we get a palindrome (22220322302222).
The spelling of 11210120201011 in words is "eleven trillion, two hundred ten billion, one hundred twenty million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •