Base | Representation |
---|---|
bin | 11011100010101… |
… | …10110010110111 |
3 | 121002202011100200 |
4 | 31301112302313 |
5 | 433121322411 |
6 | 34532011543 |
7 | 5503553340 |
oct | 1561266267 |
9 | 532664320 |
10 | 231042231 |
11 | 1094654a2 |
12 | 65460bb3 |
13 | 38b357a4 |
14 | 229830c7 |
15 | 1543be56 |
hex | dc56cb7 |
231042231 has 48 divisors (see below), whose sum is σ = 388876800. Its totient is φ = 129470400.
The previous prime is 231042221. The next prime is 231042233. The reversal of 231042231 is 132240132.
It is not a de Polignac number, because 231042231 - 27 = 231042103 is a prime.
It is a super-2 number, since 2×2310422312 = 106761025010914722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231042233) 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 47 ways as a sum of consecutive naturals, for example, 1417356 + ... + 1417518.
It is an arithmetic number, because the mean of its divisors is an integer number (8101600).
Almost surely, 2231042231 is an apocalyptic number.
231042231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
231042231 is a deficient number, since it is larger than the sum of its proper divisors (157834569).
231042231 is a wasteful number, since it uses less digits than its factorization.
231042231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476 (or 473 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 231042231 is about 15200.0733879807. The cubic root of 231042231 is about 613.6166328351.
Adding to 231042231 its reverse (132240132), we get a palindrome (363282363).
The spelling of 231042231 in words is "two hundred thirty-one million, forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •