Base | Representation |
---|---|
bin | 111001001010001001… |
… | …111100000100111001 |
3 | 12212102020101001001222 |
4 | 321022021330010321 |
5 | 2001143124131442 |
6 | 44110014321425 |
7 | 4301616341501 |
oct | 711211740471 |
9 | 185366331058 |
10 | 61373661497 |
11 | 240349172a5 |
12 | ba89ab9275 |
13 | 5a31216445 |
14 | 2d830aaa01 |
15 | 18e31438d2 |
hex | e4a27c139 |
61373661497 has 4 divisors (see below), whose sum is σ = 62214396660. Its totient is φ = 60532926336.
The previous prime is 61373661467. The next prime is 61373661551. The reversal of 61373661497 is 79416637316.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51702119161 + 9671542336 = 227381^2 + 98344^2 .
It is a cyclic number.
It is not a de Polignac number, because 61373661497 - 28 = 61373661241 is a prime.
It is a super-3 number, since 3×613736614973 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61373661407) 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 in 3 ways as a sum of consecutive naturals, for example, 420367472 + ... + 420367617.
It is an arithmetic number, because the mean of its divisors is an integer number (15553599165).
Almost surely, 261373661497 is an apocalyptic number.
It is an amenable number.
61373661497 is a deficient number, since it is larger than the sum of its proper divisors (840735163).
61373661497 is an equidigital number, since it uses as much as digits as its factorization.
61373661497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840735162.
The product of its digits is 3429216, while the sum is 53.
The spelling of 61373661497 in words is "sixty-one billion, three hundred seventy-three million, six hundred sixty-one thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •