Base | Representation |
---|---|
bin | 100101111010001000010… |
… | …000100111000011010001 |
3 | 100020001001110021020211221 |
4 | 211322020100213003101 |
5 | 320140103234041014 |
6 | 5312423115205041 |
7 | 356131140443563 |
oct | 45721020470321 |
9 | 10201043236757 |
10 | 2605036237009 |
11 | 914876051828 |
12 | 360a59446781 |
13 | 15b8666ca27b |
14 | 90127949333 |
15 | 47b6a05db24 |
hex | 25e884270d1 |
2605036237009 has 2 divisors, whose sum is σ = 2605036237010. Its totient is φ = 2605036237008.
The previous prime is 2605036237007. The next prime is 2605036237021. The reversal of 2605036237009 is 9007326305062.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2306343382225 + 298692854784 = 1518665^2 + 546528^2 .
It is a cyclic number.
It is not a de Polignac number, because 2605036237009 - 21 = 2605036237007 is a prime.
It is a super-2 number, since 2×26050362370092 (a number of 26 digits) contains 22 as substring.
Together with 2605036237007, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2605036237003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302518118504 + 1302518118505.
It is an arithmetic number, because the mean of its divisors is an integer number (1302518118505).
Almost surely, 22605036237009 is an apocalyptic number.
It is an amenable number.
2605036237009 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605036237009 is an equidigital number, since it uses as much as digits as its factorization.
2605036237009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 43.
The spelling of 2605036237009 in words is "two trillion, six hundred five billion, thirty-six million, two hundred thirty-seven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •