Base | Representation |
---|---|
bin | 1010000110001110001101… |
… | …0111111101000010010100 |
3 | 1110022100020011211202211211 |
4 | 2201203203113331002110 |
5 | 2423343404102401322 |
6 | 35340105412111204 |
7 | 2224044106446001 |
oct | 241434327750224 |
9 | 43270204752754 |
10 | 11102010200212 |
11 | 35a03773691a8 |
12 | 12b3788905504 |
13 | 626bb853c879 |
14 | 2a54a95888a8 |
15 | 143bc711db77 |
hex | a18e35fd094 |
11102010200212 has 12 divisors (see below), whose sum is σ = 19431391513716. Its totient is φ = 5550184053440.
The previous prime is 11102010200191. The next prime is 11102010200221. The reversal of 11102010200212 is 21200201020111.
It can be written as a sum of positive squares in 2 ways, for example, as 6920287854736 + 4181722345476 = 2630644^2 + 2044926^2 .
It is a super-2 number, since 2×111020102002122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11102010200192 and 11102010200201.
It is a congruent number.
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, 205231243 + ... + 205285330.
It is an arithmetic number, because the mean of its divisors is an integer number (1619282626143).
Almost surely, 211102010200212 is an apocalyptic number.
It is an amenable number.
11102010200212 is a deficient number, since it is larger than the sum of its proper divisors (8329381313504).
11102010200212 is a wasteful number, since it uses less digits than its factorization.
11102010200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410523338 (or 410523336 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11102010200212 its reverse (21200201020111), we get a palindrome (32302211220323).
The spelling of 11102010200212 in words is "eleven trillion, one hundred two billion, ten million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •