Base | Representation |
---|---|
bin | 1010001011111011010000… |
… | …0001011000100000111111 |
3 | 1110122201011020221110201000 |
4 | 2202332310001120200333 |
5 | 2432000100000031421 |
6 | 35453113045421343 |
7 | 2234113304146434 |
oct | 242766401304077 |
9 | 43581136843630 |
10 | 11200000002111 |
11 | 3628991021758 |
12 | 130a77540a853 |
13 | 63320374417b |
14 | 2aa123657b8b |
15 | 14650eb2e226 |
hex | a2fb405883f |
11200000002111 has 8 divisors (see below), whose sum is σ = 16592592595760. Its totient is φ = 7466666668056.
The previous prime is 11200000002109. The next prime is 11200000002151. The reversal of 11200000002111 is 11120000000211.
It is a happy number.
It is not a de Polignac number, because 11200000002111 - 21 = 11200000002109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11200000002093 and 11200000002102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200000002151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207407407420 + ... + 207407407473.
It is an arithmetic number, because the mean of its divisors is an integer number (2074074074470).
Almost surely, 211200000002111 is an apocalyptic number.
11200000002111 is a deficient number, since it is larger than the sum of its proper divisors (5392592593649).
11200000002111 is an equidigital number, since it uses as much as digits as its factorization.
11200000002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414814814902 (or 414814814896 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11200000002111 its reverse (11120000000211), we get a palindrome (22320000002322).
The spelling of 11200000002111 in words is "eleven trillion, two hundred billion, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •