Base | Representation |
---|---|
bin | 11011101010010… |
… | …10011111101111 |
3 | 121011121212122001 |
4 | 31311022133233 |
5 | 433400243211 |
6 | 35005233131 |
7 | 5515211500 |
oct | 1565123757 |
9 | 534555561 |
10 | 232040431 |
11 | 109a87457 |
12 | 658627a7 |
13 | 390c4c3c |
14 | 22b62ba7 |
15 | 15587ac1 |
hex | dd4a7ef |
232040431 has 24 divisors (see below), whose sum is σ = 279621936. Its totient is φ = 191842560.
The previous prime is 232040411. The next prime is 232040437. The reversal of 232040431 is 134040232.
It is not a de Polignac number, because 232040431 - 211 = 232038383 is a prime.
It is a super-2 number, since 2×2320404312 = 107685523237331522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232040399 and 232040408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232040437) 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 23 ways as a sum of consecutive naturals, for example, 237015 + ... + 237991.
It is an arithmetic number, because the mean of its divisors is an integer number (11650914).
Almost surely, 2232040431 is an apocalyptic number.
232040431 is a deficient number, since it is larger than the sum of its proper divisors (47581505).
232040431 is a wasteful number, since it uses less digits than its factorization.
232040431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159 (or 1152 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 232040431 is about 15232.8733665057. The cubic root of 232040431 is about 614.4990575586.
Adding to 232040431 its reverse (134040232), we get a palindrome (366080663).
The spelling of 232040431 in words is "two hundred thirty-two million, forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •