Base | Representation |
---|---|
bin | 110011110101010111… |
… | …0011101111100010101 |
3 | 101122022112121021120011 |
4 | 1213222232131330111 |
5 | 3310431412412323 |
6 | 123045223240221 |
7 | 11020264235230 |
oct | 1475256357425 |
9 | 348275537504 |
10 | 111312232213 |
11 | 43230942646 |
12 | 196a62a9071 |
13 | a65c328780 |
14 | 555d5aa417 |
15 | 2d6740220d |
hex | 19eab9df15 |
111312232213 has 32 divisors (see below), whose sum is σ = 140580582912. Its totient is φ = 85776537600.
The previous prime is 111312232201. The next prime is 111312232231. The reversal of 111312232213 is 312232213111.
It is not a de Polignac number, because 111312232213 - 213 = 111312224021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111312233213) 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, 2187328 + ... + 2237638.
It is an arithmetic number, because the mean of its divisors is an integer number (4393143216).
Almost surely, 2111312232213 is an apocalyptic number.
111312232213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
111312232213 is a deficient number, since it is larger than the sum of its proper divisors (29268350699).
111312232213 is a wasteful number, since it uses less digits than its factorization.
111312232213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50965.
The product of its digits is 432, while the sum is 22.
Adding to 111312232213 its reverse (312232213111), we get a palindrome (423544445324).
It can be divided in two parts, 111 and 312232213, that multiplied together give a palindrome (34657775643).
The spelling of 111312232213 in words is "one hundred eleven billion, three hundred twelve million, two hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •