Base | Representation |
---|---|
bin | 1010000000111111010011… |
… | …1010101011010010010001 |
3 | 1102222202011220010200101110 |
4 | 2200033310322223102101 |
5 | 2420410300202431001 |
6 | 35230521003123533 |
7 | 2214412233202566 |
oct | 240176472532221 |
9 | 42882156120343 |
10 | 11012110202001 |
11 | 356623413aa17 |
12 | 129a2795135a9 |
13 | 61b58c361b5c |
14 | 2a0dbba7c86d |
15 | 1416b49473d6 |
hex | a03f4eab491 |
11012110202001 has 16 divisors (see below), whose sum is σ = 16222443675264. Its totient is φ = 6609143718144.
The previous prime is 11012110201969. The next prime is 11012110202033. The reversal of 11012110202001 is 10020201121011.
It is an interprime number because it is at equal distance from previous prime (11012110201969) and next prime (11012110202033).
It is not a de Polignac number, because 11012110202001 - 25 = 11012110201969 is a prime.
It is a super-2 number, since 2×110121102020012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11012110202801) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4693992946 + ... + 4693995291.
It is an arithmetic number, because the mean of its divisors is an integer number (1013902729704).
Almost surely, 211012110202001 is an apocalyptic number.
It is an amenable number.
11012110202001 is a deficient number, since it is larger than the sum of its proper divisors (5210333473263).
11012110202001 is a wasteful number, since it uses less digits than its factorization.
11012110202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9387988280.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11012110202001 its reverse (10020201121011), we get a palindrome (21032311323012).
The spelling of 11012110202001 in words is "eleven trillion, twelve billion, one hundred ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •