Base | Representation |
---|---|
bin | 1010001100100000100010… |
… | …1110011000101101010000 |
3 | 1110200122222221102212200111 |
4 | 2203020020232120231100 |
5 | 2432131100310120422 |
6 | 35501450304331104 |
7 | 2234616344331022 |
oct | 243101056305520 |
9 | 43618887385614 |
10 | 11210011020112 |
11 | 3632158a81753 |
12 | 13106aa013a94 |
13 | 63413a7bb668 |
14 | 2aa7d3048012 |
15 | 1468e8966a77 |
hex | a3208b98b50 |
11210011020112 has 10 divisors (see below), whose sum is σ = 21719396351498. Its totient is φ = 5605005510048.
The previous prime is 11210011020107. The next prime is 11210011020119. The reversal of 11210011020112 is 21102011001211.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 10825442361616 + 384568658496 = 3290204^2 + 620136^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11210011020092 and 11210011020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210011020119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 350312844363 + ... + 350312844394.
Almost surely, 211210011020112 is an apocalyptic number.
It is an amenable number.
11210011020112 is a deficient number, since it is larger than the sum of its proper divisors (10509385331386).
11210011020112 is an equidigital number, since it uses as much as digits as its factorization.
11210011020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700625688765 (or 700625688759 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11210011020112 its reverse (21102011001211), we get a palindrome (32312022021323).
The spelling of 11210011020112 in words is "eleven trillion, two hundred ten billion, eleven million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •