Base | Representation |
---|---|
bin | 1011111011001110110111… |
… | …1100110100011101100111 |
3 | 1201102111222000102200020121 |
4 | 2332303231330310131213 |
5 | 3204312322434043421 |
6 | 43515402032542411 |
7 | 2522220224565664 |
oct | 276635574643547 |
9 | 51374860380217 |
10 | 13112232331111 |
11 | 41a5959352251 |
12 | 15792a40b1a07 |
13 | 74162a7c69b4 |
14 | 3348c78a0a6b |
15 | 17b12c735d41 |
hex | becedf34767 |
13112232331111 has 4 divisors (see below), whose sum is σ = 13883540115312. Its totient is φ = 12340924546912.
The previous prime is 13112232331057. The next prime is 13112232331157. The reversal of 13112232331111 is 11113323221131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13112232331111 - 29 = 13112232330599 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 (13112232331411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 385653892075 + ... + 385653892108.
It is an arithmetic number, because the mean of its divisors is an integer number (3470885028828).
Almost surely, 213112232331111 is an apocalyptic number.
13112232331111 is a deficient number, since it is larger than the sum of its proper divisors (771307784201).
13112232331111 is an equidigital number, since it uses as much as digits as its factorization.
13112232331111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771307784200.
The product of its digits is 648, while the sum is 25.
Adding to 13112232331111 its reverse (11113323221131), we get a palindrome (24225555552242).
The spelling of 13112232331111 in words is "thirteen trillion, one hundred twelve billion, two hundred thirty-two million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •