Base | Representation |
---|---|
bin | 110100100011000111111011… |
… | …011010101100110101111111 |
3 | 1010022022002202112201112202020 |
4 | 310203013323122230311333 |
5 | 220243020102001423403 |
6 | 2135311234504331223 |
7 | 66452204421130263 |
oct | 6443077332546577 |
9 | 1108262675645666 |
10 | 231112113311103 |
11 | 6770410797a302 |
12 | 21b070ab173b13 |
13 | 9bc5a17c623ab |
14 | 410dc591500a3 |
15 | 1babb52ebd453 |
hex | d231fb6acd7f |
231112113311103 has 8 divisors (see below), whose sum is σ = 308149559433216. Its totient is φ = 154074704698200.
The previous prime is 231112113311099. The next prime is 231112113311129. The reversal of 231112113311103 is 301113311211132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231112113311103 - 22 = 231112113311099 is a prime.
It is a super-2 number, since 2×2311121133111032 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231112113311173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11889858 + ... + 24568128.
It is an arithmetic number, because the mean of its divisors is an integer number (38518694929152).
Almost surely, 2231112113311103 is an apocalyptic number.
231112113311103 is a deficient number, since it is larger than the sum of its proper divisors (77037446122113).
231112113311103 is a wasteful number, since it uses less digits than its factorization.
231112113311103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18754605.
The product of its (nonzero) digits is 324, while the sum is 24.
Adding to 231112113311103 its reverse (301113311211132), we get a palindrome (532225424522235).
The spelling of 231112113311103 in words is "two hundred thirty-one trillion, one hundred twelve billion, one hundred thirteen million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •