Base | Representation |
---|---|
bin | 1010000110110100001011… |
… | …0110111110010011110001 |
3 | 1110100022112110201000201212 |
4 | 2201231002312332103301 |
5 | 2424030242214231001 |
6 | 35344513012005505 |
7 | 2224554504256250 |
oct | 241550266762361 |
9 | 43308473630655 |
10 | 11112202102001 |
11 | 35a4727434930 |
12 | 12b5752000895 |
13 | 627b50c0a2a0 |
14 | 2a5b94dc2797 |
15 | 1440c1c867bb |
hex | a1b42dbe4f1 |
11112202102001 has 64 divisors (see below), whose sum is σ = 15285637011456. Its totient is φ = 7796898777600.
The previous prime is 11112202101961. The next prime is 11112202102037. The reversal of 11112202102001 is 10020120221111.
It is a cyclic number.
It is not a de Polignac number, because 11112202102001 - 26 = 11112202101937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11112202102081) 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 63 ways as a sum of consecutive naturals, for example, 671545610 + ... + 671562156.
It is an arithmetic number, because the mean of its divisors is an integer number (238838078304).
Almost surely, 211112202102001 is an apocalyptic number.
11112202102001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11112202102001 is a deficient number, since it is larger than the sum of its proper divisors (4173434909455).
11112202102001 is a wasteful number, since it uses less digits than its factorization.
11112202102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32982.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11112202102001 its reverse (10020120221111), we get a palindrome (21132322323112).
The spelling of 11112202102001 in words is "eleven trillion, one hundred twelve billion, two hundred two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •