Base | Representation |
---|---|
bin | 1010000001110011111000… |
… | …1010111100101011100010 |
3 | 1110001002121111221022011101 |
4 | 2200130332022330223202 |
5 | 2421123201332344320 |
6 | 35241213305105014 |
7 | 2215422053333425 |
oct | 240347612745342 |
9 | 43032544838141 |
10 | 11026224106210 |
11 | 3571217067065 |
12 | 12a0b5818816a |
13 | 61c9cb442171 |
14 | 2a195a3259bc |
15 | 141c3da79c0a |
hex | a073e2bcae2 |
11026224106210 has 8 divisors (see below), whose sum is σ = 19847203391196. Its totient is φ = 4410489642480.
The previous prime is 11026224106181. The next prime is 11026224106217. The reversal of 11026224106210 is 1260142262011.
11026224106210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 8979210020089 + 2047014086121 = 2996533^2 + 1430739^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (11026224106217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551311205301 + ... + 551311205320.
Almost surely, 211026224106210 is an apocalyptic number.
11026224106210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11026224106210 is a deficient number, since it is larger than the sum of its proper divisors (8820979284986).
11026224106210 is a wasteful number, since it uses less digits than its factorization.
11026224106210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1102622410628.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 11026224106210 its reverse (1260142262011), we get a palindrome (12286366368221).
The spelling of 11026224106210 in words is "eleven trillion, twenty-six billion, two hundred twenty-four million, one hundred six thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •