Base | Representation |
---|---|
bin | 11011100010100… |
… | …11110101110011 |
3 | 121002201112202112 |
4 | 31301103311303 |
5 | 433120431011 |
6 | 34531435535 |
7 | 5503503143 |
oct | 1561236563 |
9 | 532645675 |
10 | 231030131 |
11 | 1094573a2 |
12 | 65455bab |
13 | 38b30127 |
14 | 2297c923 |
15 | 1543858b |
hex | dc53d73 |
231030131 has 4 divisors (see below), whose sum is σ = 231071064. Its totient is φ = 230989200.
The previous prime is 231030089. The next prime is 231030143. The reversal of 231030131 is 131030132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 231030131 - 214 = 231013747 is a prime.
It is a super-2 number, since 2×2310301312 = 106749842859754322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231030161) 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, 10325 + ... + 23846.
It is an arithmetic number, because the mean of its divisors is an integer number (57767766).
Almost surely, 2231030131 is an apocalyptic number.
231030131 is a deficient number, since it is larger than the sum of its proper divisors (40933).
231030131 is an equidigital number, since it uses as much as digits as its factorization.
231030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40932.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 231030131 is about 15199.6753583753. The cubic root of 231030131 is about 613.6059206652.
Adding to 231030131 its reverse (131030132), we get a palindrome (362060263).
Subtracting from 231030131 its reverse (131030132), we obtain a palindrome (99999999).
The spelling of 231030131 in words is "two hundred thirty-one million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •