Base | Representation |
---|---|
bin | 10001101011000… |
… | …110111001110101 |
3 | 202122221102120012 |
4 | 101223012321311 |
5 | 1101401410031 |
6 | 45231150005 |
7 | 10230214541 |
oct | 2153067165 |
9 | 678842505 |
10 | 296513141 |
11 | 142412791 |
12 | 83375305 |
13 | 49579982 |
14 | 2b546a21 |
15 | 1b070b2b |
hex | 11ac6e75 |
296513141 has 2 divisors, whose sum is σ = 296513142. Its totient is φ = 296513140.
The previous prime is 296513089. The next prime is 296513143. The reversal of 296513141 is 141315692.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 287980900 + 8532241 = 16970^2 + 2921^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-296513141 is a prime.
Together with 296513143, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 296513098 and 296513107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (296513143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 148256570 + 148256571.
It is an arithmetic number, because the mean of its divisors is an integer number (148256571).
Almost surely, 2296513141 is an apocalyptic number.
It is an amenable number.
296513141 is a deficient number, since it is larger than the sum of its proper divisors (1).
296513141 is an equidigital number, since it uses as much as digits as its factorization.
296513141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6480, while the sum is 32.
The square root of 296513141 is about 17219.5569339051. The cubic root of 296513141 is about 666.8292605361.
The spelling of 296513141 in words is "two hundred ninety-six million, five hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •