Base | Representation |
---|---|
bin | 1101011101110001011… |
… | …0010101101010011111 |
3 | 211010002210102011220222 |
4 | 3113130112111222133 |
5 | 12242231002010421 |
6 | 254134355031555 |
7 | 22466401330622 |
oct | 3273426255237 |
9 | 733083364828 |
10 | 231330110111 |
11 | 8a1198a8691 |
12 | 389bbb9b5bb |
13 | 18a78132379 |
14 | b2a7047db9 |
15 | 603dc39cab |
hex | 35dc595a9f |
231330110111 has 4 divisors (see below), whose sum is σ = 231364021392. Its totient is φ = 231296198832.
The previous prime is 231330110047. The next prime is 231330110159. The reversal of 231330110111 is 111011033132.
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 231330110111 - 26 = 231330110047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 231330110111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231330110311) 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 3 ways as a sum of consecutive naturals, for example, 16945406 + ... + 16959051.
It is an arithmetic number, because the mean of its divisors is an integer number (57841005348).
Almost surely, 2231330110111 is an apocalyptic number.
231330110111 is a deficient number, since it is larger than the sum of its proper divisors (33911281).
231330110111 is an equidigital number, since it uses as much as digits as its factorization.
231330110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33911280.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 231330110111 its reverse (111011033132), we get a palindrome (342341143243).
The spelling of 231330110111 in words is "two hundred thirty-one billion, three hundred thirty million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •