Base | Representation |
---|---|
bin | 11011101100010… |
… | …10011011101011 |
3 | 121012010011212110 |
4 | 31312022123223 |
5 | 433432133230 |
6 | 35015013403 |
7 | 5520352140 |
oct | 1566123353 |
9 | 535104773 |
10 | 232302315 |
11 | 10a146193 |
12 | 6596a263 |
13 | 391871bb |
14 | 22bd03c7 |
15 | 155da4b0 |
hex | dd8a6eb |
232302315 has 32 divisors (see below), whose sum is σ = 425617920. Its totient is φ = 105986304.
The previous prime is 232302311. The next prime is 232302319. The reversal of 232302315 is 513203232.
It is an interprime number because it is at equal distance from previous prime (232302311) and next prime (232302319).
It is not a de Polignac number, because 232302315 - 22 = 232302311 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 232302291 and 232302300.
It is not an unprimeable number, because it can be changed into a prime (232302311) 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 31 ways as a sum of consecutive naturals, for example, 59751 + ... + 63519.
It is an arithmetic number, because the mean of its divisors is an integer number (13300560).
Almost surely, 2232302315 is an apocalyptic number.
232302315 is a deficient number, since it is larger than the sum of its proper divisors (193315605).
232302315 is a wasteful number, since it uses less digits than its factorization.
232302315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4371.
The product of its (nonzero) digits is 1080, while the sum is 21.
The square root of 232302315 is about 15241.4669569566. The cubic root of 232302315 is about 614.7301479865.
Adding to 232302315 its reverse (513203232), we get a palindrome (745505547).
The spelling of 232302315 in words is "two hundred thirty-two million, three hundred two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •