Base | Representation |
---|---|
bin | 11100001011100… |
… | …10011010100001 |
3 | 121110211021102102 |
4 | 32011302122201 |
5 | 441004220431 |
6 | 35242500145 |
7 | 5600231462 |
oct | 1605623241 |
9 | 543737372 |
10 | 236398241 |
11 | 111493552 |
12 | 67204655 |
13 | 39c8c621 |
14 | 23578d69 |
15 | 15b48dcb |
hex | e1726a1 |
236398241 has 4 divisors (see below), whose sum is σ = 240273684. Its totient is φ = 232522800.
The previous prime is 236398237. The next prime is 236398249. The reversal of 236398241 is 142893632.
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 21160000 + 215238241 = 4600^2 + 14671^2 .
It is a cyclic number.
It is not a de Polignac number, because 236398241 - 22 = 236398237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 236398195 and 236398204.
It is not an unprimeable number, because it can be changed into a prime (236398249) 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 3 ways as a sum of consecutive naturals, for example, 1937630 + ... + 1937751.
It is an arithmetic number, because the mean of its divisors is an integer number (60068421).
Almost surely, 2236398241 is an apocalyptic number.
It is an amenable number.
236398241 is a deficient number, since it is larger than the sum of its proper divisors (3875443).
236398241 is an equidigital number, since it uses as much as digits as its factorization.
236398241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3875442.
The product of its digits is 62208, while the sum is 38.
The square root of 236398241 is about 15375.2476728019. The cubic root of 236398241 is about 618.3220681384.
The spelling of 236398241 in words is "two hundred thirty-six million, three hundred ninety-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •