Base | Representation |
---|---|
bin | 11110101110000010101… |
… | …010011101011100111100 |
3 | 21110210220200122122102210 |
4 | 132232002222131130330 |
5 | 234041332401023400 |
6 | 4253442324420420 |
7 | 305342033243556 |
oct | 36560252353474 |
9 | 7423820578383 |
10 | 2111021111100 |
11 | 744308423870 |
12 | 2a1168847710 |
13 | 1240b7480515 |
14 | 742615184d6 |
15 | 39da4a76950 |
hex | 1eb82a9d73c |
2111021111100 has 72 divisors (see below), whose sum is σ = 6663150281088. Its totient is φ = 511762692800.
The previous prime is 2111021111099. The next prime is 2111021111119. The reversal of 2111021111100 is 11111201112.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 319848384 + ... + 319854983.
It is an arithmetic number, because the mean of its divisors is an integer number (92543753904).
Almost surely, 22111021111100 is an apocalyptic number.
2111021111100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2111021111100 is an abundant number, since it is smaller than the sum of its proper divisors (4552129169988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111021111100 is a wasteful number, since it uses less digits than its factorization.
2111021111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639703395 (or 639703388 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 2111021111100 its reverse (11111201112), we get a palindrome (2122132312212).
The spelling of 2111021111100 in words is "two trillion, one hundred eleven billion, twenty-one million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •