Base | Representation |
---|---|
bin | 10101011100110000… |
… | …010010110010100111 |
3 | 2012110001220000220120 |
4 | 111130300102302213 |
5 | 334131414001411 |
6 | 14325202133023 |
7 | 1443505162161 |
oct | 253460226247 |
9 | 65401800816 |
10 | 23031000231 |
11 | 9849443398 |
12 | 4569051173 |
13 | 22306244b5 |
14 | 1186a7b931 |
15 | 8ebdd5106 |
hex | 55cc12ca7 |
23031000231 has 8 divisors (see below), whose sum is σ = 30710386560. Its totient is φ = 15352807032.
The previous prime is 23031000229. The next prime is 23031000263. The reversal of 23031000231 is 13200013032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23031000231 - 21 = 23031000229 is a prime.
It is a super-2 number, since 2×230310002312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23031000231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23031000281) 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 7 ways as a sum of consecutive naturals, for example, 252225 + ... + 331178.
It is an arithmetic number, because the mean of its divisors is an integer number (3838798320).
Almost surely, 223031000231 is an apocalyptic number.
23031000231 is a deficient number, since it is larger than the sum of its proper divisors (7679386329).
23031000231 is a wasteful number, since it uses less digits than its factorization.
23031000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596565.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 23031000231 its reverse (13200013032), we get a palindrome (36231013263).
The spelling of 23031000231 in words is "twenty-three billion, thirty-one million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •