Base | Representation |
---|---|
bin | 110100100011011001100001… |
… | …010010001101110100100111 |
3 | 1010022100220111221120011010220 |
4 | 310203121201102031310213 |
5 | 220243322243032411403 |
6 | 2135324041103415423 |
7 | 66453443462245641 |
oct | 6443314122156447 |
9 | 1108326457504126 |
10 | 231131002232103 |
11 | 67711120207216 |
12 | 21b0a8a0bb4573 |
13 | 9bc77383aa61c |
14 | 4110b2ba51891 |
15 | 1bac3ab415953 |
hex | d2366148dd27 |
231131002232103 has 8 divisors (see below), whose sum is σ = 308193231093888. Its totient is φ = 154078054095864.
The previous prime is 231131002232051. The next prime is 231131002232129. The reversal of 231131002232103 is 301232200131132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231131002232103 - 213 = 231131002223911 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231131002237103) 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 7 ways as a sum of consecutive naturals, for example, 2320123275 + ... + 2320222892.
It is an arithmetic number, because the mean of its divisors is an integer number (38524153886736).
Almost surely, 2231131002232103 is an apocalyptic number.
231131002232103 is a deficient number, since it is larger than the sum of its proper divisors (77062228861785).
231131002232103 is a wasteful number, since it uses less digits than its factorization.
231131002232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4640362773.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 231131002232103 its reverse (301232200131132), we get a palindrome (532363202363235).
The spelling of 231131002232103 in words is "two hundred thirty-one trillion, one hundred thirty-one billion, two million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •