Base | Representation |
---|---|
bin | 11011101011000… |
… | …00101001001001 |
3 | 121011210111001211 |
4 | 31311200221021 |
5 | 433411144040 |
6 | 35011213121 |
7 | 5516040121 |
oct | 1565405111 |
9 | 534714054 |
10 | 232131145 |
11 | 10a039624 |
12 | 658a71a1 |
13 | 3912730c |
14 | 22b87c81 |
15 | 155a48ea |
hex | dd60a49 |
232131145 has 4 divisors (see below), whose sum is σ = 278557380. Its totient is φ = 185704912.
The previous prime is 232131101. The next prime is 232131161. The reversal of 232131145 is 541131232.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35093776 + 197037369 = 5924^2 + 14037^2 .
It is a cyclic number.
It is not a de Polignac number, because 232131145 - 217 = 232000073 is a prime.
It is a super-2 number, since 2×2321311452 = 107769736958022050, which contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 23213110 + ... + 23213119.
It is an arithmetic number, because the mean of its divisors is an integer number (69639345).
Almost surely, 2232131145 is an apocalyptic number.
It is an amenable number.
232131145 is a deficient number, since it is larger than the sum of its proper divisors (46426235).
232131145 is an equidigital number, since it uses as much as digits as its factorization.
232131145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46426234.
The product of its digits is 720, while the sum is 22.
The square root of 232131145 is about 15235.8506490448. The cubic root of 232131145 is about 614.5791246467.
Adding to 232131145 its reverse (541131232), we get a palindrome (773262377).
The spelling of 232131145 in words is "two hundred thirty-two million, one hundred thirty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •