Base | Representation |
---|---|
bin | 11001000011100111101111… |
… | …110110101011011111011011 |
3 | 112110012000110110211120100222 |
4 | 121003213233312223133123 |
5 | 103421004100000031021 |
6 | 1030213103041550255 |
7 | 32132454505502453 |
oct | 3103475766533733 |
9 | 473160413746328 |
10 | 110200000002011 |
11 | 32127615102957 |
12 | 104395b904538b |
13 | 4964a7a5c150a |
14 | 1d2d9cc022d63 |
15 | cb184cb876ab |
hex | 6439efdab7db |
110200000002011 has 16 divisors (see below), whose sum is σ = 112524884446464. Its totient is φ = 107895238692384.
The previous prime is 110200000001933. The next prime is 110200000002013.
110200000002011 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 110200000002011 - 226 = 110199932893147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110200000002011.
It is not an unprimeable number, because it can be changed into a prime (110200000002013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122328116 + ... + 123225678.
It is an arithmetic number, because the mean of its divisors is an integer number (7032805277904).
Almost surely, 2110200000002011 is an apocalyptic number.
110200000002011 is a deficient number, since it is larger than the sum of its proper divisors (2324884444453).
110200000002011 is a wasteful number, since it uses less digits than its factorization.
110200000002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908770.
The product of its (nonzero) digits is 4, while the sum is 8.
It can be divided in two parts, 11020000000 and 2011, that added together give a palindrome (11020002011).
The spelling of 110200000002011 in words is "one hundred ten trillion, two hundred billion, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •