Base | Representation |
---|---|
bin | 11011100010101… |
… | …10100000000111 |
3 | 121002202002201020 |
4 | 31301112200013 |
5 | 433121303111 |
6 | 34532002223 |
7 | 5503550004 |
oct | 1561264007 |
9 | 532662636 |
10 | 231041031 |
11 | 109464601 |
12 | 65460373 |
13 | 38b35090 |
14 | 229828ab |
15 | 1543b906 |
hex | dc56807 |
231041031 has 8 divisors (see below), whose sum is σ = 331751280. Its totient is φ = 142179072.
The previous prime is 231040973. The next prime is 231041059. The reversal of 231041031 is 130140132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231041031 - 27 = 231040903 is a prime.
It is a super-2 number, since 2×2310410312 = 106759916011085922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 231041031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231041081) 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, 2962026 + ... + 2962103.
It is an arithmetic number, because the mean of its divisors is an integer number (41468910).
Almost surely, 2231041031 is an apocalyptic number.
231041031 is a deficient number, since it is larger than the sum of its proper divisors (100710249).
231041031 is a wasteful number, since it uses less digits than its factorization.
231041031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5924145.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 231041031 is about 15200.0339144358. The cubic root of 231041031 is about 613.6155704878.
Adding to 231041031 its reverse (130140132), we get a palindrome (361181163).
The spelling of 231041031 in words is "two hundred thirty-one million, forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •