Base | Representation |
---|---|
bin | 11011101000001… |
… | …01001101100001 |
3 | 121011002110100022 |
4 | 31310011031201 |
5 | 433312203031 |
6 | 34555203225 |
7 | 5512620224 |
oct | 1564051541 |
9 | 534073308 |
10 | 231756641 |
11 | 109903216 |
12 | 65746515 |
13 | 39025a0c |
14 | 22acb5bb |
15 | 1552d97b |
hex | dd05361 |
231756641 has 12 divisors (see below), whose sum is σ = 244058220. Its totient is φ = 219939840.
The previous prime is 231756617. The next prime is 231756653. The reversal of 231756641 is 146657132.
It can be written as a sum of positive squares in 6 ways, for example, as 9120400 + 222636241 = 3020^2 + 14921^2 .
It is a de Polignac number, because none of the positive numbers 2k-231756641 is a prime.
It is a super-2 number, since 2×2317566412 = 107422281295205762, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231756611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54065 + ... + 58193.
It is an arithmetic number, because the mean of its divisors is an integer number (20338185).
Almost surely, 2231756641 is an apocalyptic number.
It is an amenable number.
231756641 is a deficient number, since it is larger than the sum of its proper divisors (12301579).
231756641 is an equidigital number, since it uses as much as digits as its factorization.
231756641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4244 (or 4207 counting only the distinct ones).
The product of its digits is 30240, while the sum is 35.
The square root of 231756641 is about 15223.5554651336. Note that the first 3 decimals coincide. The cubic root of 231756641 is about 614.2484405594.
The spelling of 231756641 in words is "two hundred thirty-one million, seven hundred fifty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •