Base | Representation |
---|---|
bin | 11011101001110… |
… | …10101110111101 |
3 | 121011111121001212 |
4 | 31310322232331 |
5 | 433341211434 |
6 | 35004014205 |
7 | 5514522326 |
oct | 1564725675 |
9 | 534447055 |
10 | 231975869 |
11 | 109a429a4 |
12 | 65831365 |
13 | 390a1738 |
14 | 22b4744d |
15 | 155738ce |
hex | dd3abbd |
231975869 has 4 divisors (see below), whose sum is σ = 232078560. Its totient is φ = 231873180.
The previous prime is 231975839. The next prime is 231975889. The reversal of 231975869 is 968579132.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231975869 is a prime.
It is a super-2 number, since 2×2319758692 = 107625607596610322, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231975839) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47879 + ... + 52500.
It is an arithmetic number, because the mean of its divisors is an integer number (58019640).
Almost surely, 2231975869 is an apocalyptic number.
It is an amenable number.
231975869 is a deficient number, since it is larger than the sum of its proper divisors (102691).
231975869 is a wasteful number, since it uses less digits than its factorization.
231975869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102690.
The product of its digits is 816480, while the sum is 50.
The square root of 231975869 is about 15230.7540522457. The cubic root of 231975869 is about 614.4420603533.
The spelling of 231975869 in words is "two hundred thirty-one million, nine hundred seventy-five thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •