Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1101010110000110100100 |
3 | 1110022100020212021202122212 |
4 | 2201203203331112012210 |
5 | 2423343414110032322 |
6 | 35340110402142552 |
7 | 2224044255662156 |
oct | 241434375260644 |
9 | 43270225252585 |
10 | 11102020002212 |
11 | 35a0381953627 |
12 | 12b3790051a58 |
13 | 626bba592279 |
14 | 2a54aa9baad6 |
15 | 143bc7e080e2 |
hex | a18e3f561a4 |
11102020002212 has 12 divisors (see below), whose sum is σ = 19428709150620. Its totient is φ = 5550960244896.
The previous prime is 11102020002167. The next prime is 11102020002257. The reversal of 11102020002212 is 21220002020111.
It is an interprime number because it is at equal distance from previous prime (11102020002167) and next prime (11102020002257).
It can be written as a sum of positive squares in 2 ways, for example, as 8734779277156 + 2367240725056 = 2955466^2 + 1538584^2 .
It is a super-3 number, since 3×111020200022123 (a number of 40 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11934743 + ... + 12831294.
It is an arithmetic number, because the mean of its divisors is an integer number (1619059095885).
Almost surely, 211102020002212 is an apocalyptic number.
It is an amenable number.
11102020002212 is a deficient number, since it is larger than the sum of its proper divisors (8326689148408).
11102020002212 is a wasteful number, since it uses less digits than its factorization.
11102020002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24878110 (or 24878108 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11102020002212 its reverse (21220002020111), we get a palindrome (32322022022323).
The spelling of 11102020002212 in words is "eleven trillion, one hundred two billion, twenty million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •