Base | Representation |
---|---|
bin | 11101001100110011100… |
… | …001110101100111101001 |
3 | 21002211102101200211111220 |
4 | 131030303201311213221 |
5 | 230334021221020000 |
6 | 4133454215012253 |
7 | 264654525402606 |
oct | 35146341654751 |
9 | 7084371624456 |
10 | 2006614235625 |
11 | 704000472a1a |
12 | 284a8b06a089 |
13 | 1172b897146c |
14 | 6d1990ad6ad |
15 | 372e39e61a0 |
hex | 1d3338759e9 |
2006614235625 has 80 divisors (see below), whose sum is σ = 3426171524160. Its totient is φ = 1043683200000.
The previous prime is 2006614235617. The next prime is 2006614235627. The reversal of 2006614235625 is 5265324166002.
It is not a de Polignac number, because 2006614235625 - 23 = 2006614235617 is a prime.
It is a super-2 number, since 2×20066142356252 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2006614235627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 385218021 + ... + 385223229.
It is an arithmetic number, because the mean of its divisors is an integer number (42827144052).
Almost surely, 22006614235625 is an apocalyptic number.
2006614235625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2006614235625 is a deficient number, since it is larger than the sum of its proper divisors (1419557288535).
2006614235625 is an equidigital number, since it uses as much as digits as its factorization.
2006614235625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10284 (or 10269 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 2006614235625 in words is "two trillion, six billion, six hundred fourteen million, two hundred thirty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •