Base | Representation |
---|---|
bin | 10100101011011110… |
… | …01001101011110100 |
3 | 1001122201120010101202 |
4 | 22111233021223310 |
5 | 140214114201322 |
6 | 5033352312032 |
7 | 542056203050 |
oct | 122557115364 |
9 | 31581503352 |
10 | 11102100212 |
11 | 4787934235 |
12 | 219a0a2618 |
13 | 107c125088 |
14 | 77468ac60 |
15 | 44ea0b292 |
hex | 295bc9af4 |
11102100212 has 48 divisors (see below), whose sum is σ = 22830958080. Its totient is φ = 4624608000.
The previous prime is 11102100203. The next prime is 11102100287. The reversal of 11102100212 is 21200120111.
It is a junction number, because it is equal to n+sod(n) for n = 11102100193 and 11102100202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 290837 + ... + 326787.
It is an arithmetic number, because the mean of its divisors is an integer number (475644960).
Almost surely, 211102100212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11102100212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11415479040).
11102100212 is an abundant number, since it is smaller than the sum of its proper divisors (11728857868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102100212 is a wasteful number, since it uses less digits than its factorization.
11102100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36272 (or 36270 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11102100212 its reverse (21200120111), we get a palindrome (32302220323).
The spelling of 11102100212 in words is "eleven billion, one hundred two million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •