Base | Representation |
---|---|
bin | 111001001010101010… |
… | …000110010011100101 |
3 | 12212102211020100120000 |
4 | 321022222012103211 |
5 | 2001202303421010 |
6 | 44110515131513 |
7 | 4302051113313 |
oct | 711252062345 |
9 | 185384210500 |
10 | 61382092005 |
11 | 24039655263 |
12 | ba908a3b99 |
13 | 5a32ba8800 |
14 | 2d842630b3 |
15 | 18e3c5b7c0 |
hex | e4aa864e5 |
61382092005 has 90 divisors (see below), whose sum is σ = 119274199506. Its totient is φ = 30186965952.
The previous prime is 61382091989. The next prime is 61382092021. The reversal of 61382092005 is 50029028316.
It is an interprime number because it is at equal distance from previous prime (61382091989) and next prime (61382092021).
It can be written as a sum of positive squares in 3 ways, for example, as 290566116 + 61091525889 = 17046^2 + 247167^2 .
It is not a de Polignac number, because 61382092005 - 24 = 61382091989 is a prime.
It is a super-2 number, since 2×613820920052 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 in 89 ways as a sum of consecutive naturals, for example, 64816942 + ... + 64817888.
Almost surely, 261382092005 is an apocalyptic number.
61382092005 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
61382092005 is a deficient number, since it is larger than the sum of its proper divisors (57892107501).
61382092005 is an frugal number, since it uses more digits than its factorization.
61382092005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1937 (or 968 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 61382092005 in words is "sixty-one billion, three hundred eighty-two million, ninety-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •