Base | Representation |
---|---|
bin | 11011100011001… |
… | …11011010110011 |
3 | 121002212121202121 |
4 | 31301213122303 |
5 | 433131012243 |
6 | 34533255111 |
7 | 5504256013 |
oct | 1561473263 |
9 | 532777677 |
10 | 231110323 |
11 | 109501674 |
12 | 65494497 |
13 | 38b5a792 |
14 | 2299dc43 |
15 | 154521ed |
hex | dc676b3 |
231110323 has 4 divisors (see below), whose sum is σ = 231141688. Its totient is φ = 231078960.
The previous prime is 231110303. The next prime is 231110333. The reversal of 231110323 is 323011132.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231110323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231110297 and 231110306.
It is not an unprimeable number, because it can be changed into a prime (231110303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2068 + ... + 21598.
It is an arithmetic number, because the mean of its divisors is an integer number (57785422).
Almost surely, 2231110323 is an apocalyptic number.
231110323 is a deficient number, since it is larger than the sum of its proper divisors (31365).
231110323 is a wasteful number, since it uses less digits than its factorization.
231110323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31364.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 231110323 is about 15202.3130805809. The cubic root of 231110323 is about 613.6769079337.
Adding to 231110323 its reverse (323011132), we get a palindrome (554121455).
The spelling of 231110323 in words is "two hundred thirty-one million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •