Base | Representation |
---|---|
bin | 1010000000111111110111… |
… | …0111001000000011011011 |
3 | 1102222202120100111201202212 |
4 | 2200033331313020003123 |
5 | 2420411102112004303 |
6 | 35230543523345335 |
7 | 2214416034550550 |
oct | 240177567100333 |
9 | 42882510451685 |
10 | 11012260266203 |
11 | 3566300916419 |
12 | 129a2bb82224b |
13 | 61b5b4484041 |
14 | 2a0dd3982a27 |
15 | 1416c2bdaad8 |
hex | a03fddc80db |
11012260266203 has 16 divisors (see below), whose sum is σ = 13544215418304. Its totient is φ = 8738203484160.
The previous prime is 11012260266179. The next prime is 11012260266221. The reversal of 11012260266203 is 30266206221011.
It is a cyclic number.
It is not a de Polignac number, because 11012260266203 - 28 = 11012260265947 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 11012260266203.
It is not an unprimeable number, because it can be changed into a prime (11012260266233) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 758517350 + ... + 758531867.
It is an arithmetic number, because the mean of its divisors is an integer number (846513463644).
Almost surely, 211012260266203 is an apocalyptic number.
11012260266203 is a deficient number, since it is larger than the sum of its proper divisors (2531955152101).
11012260266203 is a wasteful number, since it uses less digits than its factorization.
11012260266203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1517049302.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 11012260266203 its reverse (30266206221011), we get a palindrome (41278466487214).
The spelling of 11012260266203 in words is "eleven trillion, twelve billion, two hundred sixty million, two hundred sixty-six thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •