Base | Representation |
---|---|
bin | 11001010000111000001011… |
… | …110100010001100000100110 |
3 | 112120102002220210012020001111 |
4 | 121100320023310101200212 |
5 | 104030420313030400402 |
6 | 1032151404552415234 |
7 | 32255335133432332 |
oct | 3120701364214046 |
9 | 476362823166044 |
10 | 111111002200102 |
11 | 32448a030a1a43 |
12 | 105660819a751a |
13 | 49cc9515945b8 |
14 | 1d61b306cc7c2 |
15 | cca3bb0399d7 |
hex | 650e0bd11826 |
111111002200102 has 8 divisors (see below), whose sum is σ = 166667120338176. Its totient is φ = 55555295420712.
The previous prime is 111111002200091. The next prime is 111111002200103. The reversal of 111111002200102 is 201002200111111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1111110022001022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111111002200103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102163513 + ... + 103245364.
It is an arithmetic number, because the mean of its divisors is an integer number (20833390042272).
Almost surely, 2111111002200102 is an apocalyptic number.
111111002200102 is a deficient number, since it is larger than the sum of its proper divisors (55556118138074).
111111002200102 is a wasteful number, since it uses less digits than its factorization.
111111002200102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205679342.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111111002200102 its reverse (201002200111111), we get a palindrome (312113202311213).
The spelling of 111111002200102 in words is "one hundred eleven trillion, one hundred eleven billion, two million, two hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •