Base | Representation |
---|---|
bin | 1001101001101011… |
… | …0001000111101001 |
3 | 20200112212121112121 |
4 | 2122122301013221 |
5 | 20301210130301 |
6 | 1105023511241 |
7 | 121125441064 |
oct | 23232610751 |
9 | 6615777477 |
10 | 2590708201 |
11 | 110a429464 |
12 | 603758521 |
13 | 32396b843 |
14 | 1a81038db |
15 | 1026973a1 |
hex | 9a6b11e9 |
2590708201 has 9 divisors (see below), whose sum is σ = 2709469399. Its totient is φ = 2476948936.
The previous prime is 2590708193. The next prime is 2590708207. The reversal of 2590708201 is 1028070952.
The square root of 2590708201 is 50899.
It is a perfect power (a square), and thus also a powerful number.
2590708201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2572011225 + 18696976 = 50715^2 + 4324^2 .
It is not a de Polignac number, because 2590708201 - 23 = 2590708193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2590708207) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1169571 + ... + 1171783.
Almost surely, 22590708201 is an apocalyptic number.
2590708201 is the 50899-th square number.
2590708201 is the 25450-th centered octagonal number.
It is an amenable number.
2590708201 is a deficient number, since it is larger than the sum of its proper divisors (118761198).
2590708201 is an frugal number, since it uses more digits than its factorization.
2590708201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4472 (or 2236 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 34.
The cubic root of 2590708201 is about 1373.4288524159.
The spelling of 2590708201 in words is "two billion, five hundred ninety million, seven hundred eight thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •