Base | Representation |
---|---|
bin | 11001001111011100000000… |
… | …000001100100011100000111 |
3 | 112120001122102112221010012112 |
4 | 121033130000001210130013 |
5 | 104022310104122023421 |
6 | 1032034115031011235 |
7 | 32245232226523400 |
oct | 3117340001443407 |
9 | 476048375833175 |
10 | 111012020111111 |
11 | 3240aa2a303509 |
12 | 1054aa58b09b1b |
13 | 49c3508923682 |
14 | 1d5b02091c9a7 |
15 | cc7a2636d45b |
hex | 64f700064707 |
111012020111111 has 6 divisors (see below), whose sum is σ = 129136431557880. Its totient is φ = 95153160095196.
The previous prime is 111012020111107. The next prime is 111012020111147. The reversal of 111012020111111 is 111111020210111.
It is not a de Polignac number, because 111012020111111 - 22 = 111012020111107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012020111101) 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 5 ways as a sum of consecutive naturals, for example, 1132775715371 + ... + 1132775715468.
It is an arithmetic number, because the mean of its divisors is an integer number (21522738592980).
Almost surely, 2111012020111111 is an apocalyptic number.
111012020111111 is a deficient number, since it is larger than the sum of its proper divisors (18124411446769).
111012020111111 is an equidigital number, since it uses as much as digits as its factorization.
111012020111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2265551430853 (or 2265551430846 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 111012020111111 its reverse (111111020210111), we get a palindrome (222123040321222).
The spelling of 111012020111111 in words is "one hundred eleven trillion, twelve billion, twenty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •