Base | Representation |
---|---|
bin | 1001101101000110… |
… | …1110101101101110 |
3 | 20201112222121200210 |
4 | 2123101232231232 |
5 | 20313402210040 |
6 | 1110300403250 |
7 | 121362060111 |
oct | 23321565556 |
9 | 6645877623 |
10 | 2605116270 |
11 | 111757a459 |
12 | 608546526 |
13 | 326944923 |
14 | 1a9db4578 |
15 | 103a91480 |
hex | 9b46eb6e |
2605116270 has 16 divisors (see below), whose sum is σ = 6252279120. Its totient is φ = 694697664.
The previous prime is 2605116253. The next prime is 2605116287. The reversal of 2605116270 is 726115062.
It is an interprime number because it is at equal distance from previous prime (2605116253) and next prime (2605116287).
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 86837209 = 2605116270 / (2 + 6 + 0 + 5 + 1 + 1 + 6 + 2 + 7 + 0).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43418575 + ... + 43418634.
It is an arithmetic number, because the mean of its divisors is an integer number (390767445).
Almost surely, 22605116270 is an apocalyptic number.
2605116270 is an abundant number, since it is smaller than the sum of its proper divisors (3647162850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2605116270 is a wasteful number, since it uses less digits than its factorization.
2605116270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86837219.
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 2605116270 is about 51040.3396344499. The cubic root of 2605116270 is about 1375.9702278436.
The spelling of 2605116270 in words is "two billion, six hundred five million, one hundred sixteen thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •