Base | Representation |
---|---|
bin | 11101001010101111100… |
… | …10000001011110100011 |
3 | 10112210212001022122102001 |
4 | 32211113302001132203 |
5 | 112410001212023021 |
6 | 2044223202304431 |
7 | 132256311246601 |
oct | 16452762013643 |
9 | 3483761278361 |
10 | 1002200111011 |
11 | 357037920960 |
12 | 142296958117 |
13 | 73679038888 |
14 | 36714712871 |
15 | 1b1099a6091 |
hex | e957c817a3 |
1002200111011 has 8 divisors (see below), whose sum is σ = 1093819891248. Its totient is φ = 910665444000.
The previous prime is 1002200110973. The next prime is 1002200111023. The reversal of 1002200111011 is 1101110022001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1002200111011 - 213 = 1002200102819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1002200111711) 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, 21253680 + ... + 21300781.
It is an arithmetic number, because the mean of its divisors is an integer number (136727486406).
Almost surely, 21002200111011 is an apocalyptic number.
1002200111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1002200111011 is a deficient number, since it is larger than the sum of its proper divisors (91619780237).
1002200111011 is a wasteful number, since it uses less digits than its factorization.
1002200111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42556613.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1002200111011 its reverse (1101110022001), we get a palindrome (2103310133012).
It can be divided in two parts, 10022001 and 11011, that multiplied together give a palindrome (110352253011).
The spelling of 1002200111011 in words is "one trillion, two billion, two hundred million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •