Base | Representation |
---|---|
bin | 10001010010110… |
… | …110111011100001 |
3 | 202012222110120001 |
4 | 101102312323201 |
5 | 1043240000012 |
6 | 44443020001 |
7 | 10122200416 |
oct | 2122667341 |
9 | 665873501 |
10 | 290156257 |
11 | 139870766 |
12 | 8120a601 |
13 | 481623c1 |
14 | 2a77010d |
15 | 1a717357 |
hex | 114b6ee1 |
290156257 has 4 divisors (see below), whose sum is σ = 297998356. Its totient is φ = 282314160.
The previous prime is 290156231. The next prime is 290156261. The reversal of 290156257 is 752651092.
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 132503121 + 157653136 = 11511^2 + 12556^2 .
It is a cyclic number.
It is not a de Polignac number, because 290156257 - 215 = 290123489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 7842061 = 290156257 / (2 + 9 + 0 + 1 + 5 + 6 + 2 + 5 + 7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (290156557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3920994 + ... + 3921067.
It is an arithmetic number, because the mean of its divisors is an integer number (74499589).
Almost surely, 2290156257 is an apocalyptic number.
It is an amenable number.
290156257 is a deficient number, since it is larger than the sum of its proper divisors (7842099).
290156257 is an equidigital number, since it uses as much as digits as its factorization.
290156257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7842098.
The product of its (nonzero) digits is 37800, while the sum is 37.
The square root of 290156257 is about 17033.9736115799. The cubic root of 290156257 is about 662.0294564039.
The spelling of 290156257 in words is "two hundred ninety million, one hundred fifty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •