Base | Representation |
---|---|
bin | 11101111111011111100… |
… | …110001011011111111101 |
3 | 21022000220110121210022210 |
4 | 131333133212023133331 |
5 | 232232002402200100 |
6 | 4214455022131033 |
7 | 301622336401215 |
oct | 35773746133775 |
9 | 7260813553283 |
10 | 2061040662525 |
11 | 72509a7a5019 |
12 | 29353a420a79 |
13 | 11c4807979b0 |
14 | 71a7d637245 |
15 | 3892bc94c50 |
hex | 1dfdf98b7fd |
2061040662525 has 24 divisors (see below), whose sum is σ = 3669709324960. Its totient is φ = 1014666171840.
The previous prime is 2061040662523. The next prime is 2061040662533. The reversal of 2061040662525 is 5252660401602.
It is not a de Polignac number, because 2061040662525 - 21 = 2061040662523 is a prime.
It is a super-2 number, since 2×20610406625252 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2061040662521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1056942955 + ... + 1056944904.
Almost surely, 22061040662525 is an apocalyptic number.
2061040662525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2061040662525 is a deficient number, since it is larger than the sum of its proper divisors (1608668662435).
2061040662525 is a wasteful number, since it uses less digits than its factorization.
2061040662525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2113887885 (or 2113887880 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 2061040662525 in words is "two trillion, sixty-one billion, forty million, six hundred sixty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •