Base | Representation |
---|---|
bin | 1010001100101000101111… |
… | …0011001111111010010101 |
3 | 1110200212200012102020000212 |
4 | 2203022023303033322111 |
5 | 2432200101242010401 |
6 | 35502452422415205 |
7 | 2235025006310060 |
oct | 243121363177225 |
9 | 43625605366025 |
10 | 11212210110101 |
11 | 363308733a5a0 |
12 | 1311002591505 |
13 | 6343cb291a40 |
14 | 2aa9611298d7 |
15 | 1469c6a53dbb |
hex | a328bccfe95 |
11212210110101 has 64 divisors (see below), whose sum is σ = 15139490526720. Its totient is φ = 8019123240960.
The previous prime is 11212210110071. The next prime is 11212210110161. The reversal of 11212210110101 is 10101101221211.
It is not a de Polignac number, because 11212210110101 - 222 = 11212205915797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212210110161) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 146340935 + ... + 146417531.
It is an arithmetic number, because the mean of its divisors is an integer number (236554539480).
Almost surely, 211212210110101 is an apocalyptic number.
11212210110101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11212210110101 is a deficient number, since it is larger than the sum of its proper divisors (3927280416619).
11212210110101 is a wasteful number, since it uses less digits than its factorization.
11212210110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77454.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11212210110101 its reverse (10101101221211), we get a palindrome (21313311331312).
It can be divided in two parts, 11212210 and 110101, that added together give a palindrome (11322311).
The spelling of 11212210110101 in words is "eleven trillion, two hundred twelve billion, two hundred ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •