Base | Representation |
---|---|
bin | 11011100011011… |
… | …00010000001011 |
3 | 121002220121220221 |
4 | 31301230100023 |
5 | 433132130443 |
6 | 34533530511 |
7 | 5504400520 |
oct | 1561542013 |
9 | 532817827 |
10 | 231130123 |
11 | 109515534 |
12 | 654a3a37 |
13 | 38b667b3 |
14 | 229a7147 |
15 | 15457eed |
hex | dc6c40b |
231130123 has 8 divisors (see below), whose sum is σ = 265178592. Its totient is φ = 197339136.
The previous prime is 231130111. The next prime is 231130127. The reversal of 231130123 is 321031132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 231130123 - 25 = 231130091 is a prime.
It is a super-2 number, since 2×2311301232 = 106842267515990258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231130097 and 231130106.
It is not an unprimeable number, because it can be changed into a prime (231130127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62440 + ... + 66037.
It is an arithmetic number, because the mean of its divisors is an integer number (33147324).
Almost surely, 2231130123 is an apocalyptic number.
231130123 is a deficient number, since it is larger than the sum of its proper divisors (34048469).
231130123 is a wasteful number, since it uses less digits than its factorization.
231130123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128741.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 231130123 is about 15202.9642833232. The cubic root of 231130123 is about 613.6944326893.
Adding to 231130123 its reverse (321031132), we get a palindrome (552161255).
The spelling of 231130123 in words is "two hundred thirty-one million, one hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •