Base | Representation |
---|---|
bin | 110011101100011110… |
… | …1111111100100010101 |
3 | 101121112210000101011002 |
4 | 1213120331333210111 |
5 | 3304324130442323 |
6 | 122555501553045 |
7 | 11010016040630 |
oct | 1473075774425 |
9 | 347483011132 |
10 | 111014312213 |
11 | 43098759972 |
12 | 19622575785 |
13 | a6126a864c |
14 | 5531bb8c17 |
15 | 2d4b1a4828 |
hex | 19d8f7f915 |
111014312213 has 32 divisors (see below), whose sum is σ = 130666432512. Its totient is φ = 92341166400.
The previous prime is 111014312173. The next prime is 111014312243. The reversal of 111014312213 is 312213410111.
It is not a de Polignac number, because 111014312213 - 28 = 111014311957 is a prime.
It is a super-2 number, since 2×1110143122132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111014312243) 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 31 ways as a sum of consecutive naturals, for example, 33325958 + ... + 33329288.
It is an arithmetic number, because the mean of its divisors is an integer number (4083326016).
Almost surely, 2111014312213 is an apocalyptic number.
It is an amenable number.
111014312213 is a deficient number, since it is larger than the sum of its proper divisors (19652120299).
111014312213 is a wasteful number, since it uses less digits than its factorization.
111014312213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4065.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 111014312213 its reverse (312213410111), we get a palindrome (423227722324).
The spelling of 111014312213 in words is "one hundred eleven billion, fourteen million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •