Base | Representation |
---|---|
bin | 11011100100110… |
… | …01011010111011 |
3 | 121010021000201002 |
4 | 31302121122323 |
5 | 433204041011 |
6 | 34541515215 |
7 | 5506101065 |
oct | 1562313273 |
9 | 533230632 |
10 | 231315131 |
11 | 109631533 |
12 | 65572b0b |
13 | 38bcca78 |
14 | 22a14735 |
15 | 15492c3b |
hex | dc996bb |
231315131 has 4 divisors (see below), whose sum is σ = 231345672. Its totient is φ = 231284592.
The previous prime is 231315127. The next prime is 231315169. The reversal of 231315131 is 131513132.
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 not a de Polignac number, because 231315131 - 22 = 231315127 is a prime.
It is a super-2 number, since 2×2313151312 = 107013379659094322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231315121) 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, 5591 + ... + 22223.
It is an arithmetic number, because the mean of its divisors is an integer number (57836418).
Almost surely, 2231315131 is an apocalyptic number.
231315131 is a deficient number, since it is larger than the sum of its proper divisors (30541).
231315131 is a wasteful number, since it uses less digits than its factorization.
231315131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30540.
The product of its digits is 270, while the sum is 20.
The square root of 231315131 is about 15209.0476690686. The cubic root of 231315131 is about 613.8581328274.
Adding to 231315131 its reverse (131513132), we get a palindrome (362828263).
The spelling of 231315131 in words is "two hundred thirty-one million, three hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •