Base | Representation |
---|---|
bin | 11100000001000… |
… | …00010011111001 |
3 | 121101012220201212 |
4 | 32000200103321 |
5 | 440130411434 |
6 | 35153052505 |
7 | 5552403113 |
oct | 1600402371 |
9 | 541186655 |
10 | 235013369 |
11 | 110728028 |
12 | 66857135 |
13 | 398c6186 |
14 | 232d83b3 |
15 | 159738ce |
hex | e0204f9 |
235013369 has 2 divisors, whose sum is σ = 235013370. Its totient is φ = 235013368.
The previous prime is 235013351. The next prime is 235013377. The reversal of 235013369 is 963310532.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 224850025 + 10163344 = 14995^2 + 3188^2 .
It is a cyclic number.
It is not a de Polignac number, because 235013369 - 212 = 235009273 is a prime.
It is a super-2 number, since 2×2350133692 = 110462567217460322, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (235013309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117506684 + 117506685.
It is an arithmetic number, because the mean of its divisors is an integer number (117506685).
Almost surely, 2235013369 is an apocalyptic number.
It is an amenable number.
235013369 is a deficient number, since it is larger than the sum of its proper divisors (1).
235013369 is an equidigital number, since it uses as much as digits as its factorization.
235013369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 32.
The square root of 235013369 is about 15330.1457592549. The cubic root of 235013369 is about 617.1122812085.
The spelling of 235013369 in words is "two hundred thirty-five million, thirteen thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •