Base | Representation |
---|---|
bin | 111001011111011011… |
… | …101100101101001101 |
3 | 12220100010002100200201 |
4 | 321133123230231031 |
5 | 2002411020414134 |
6 | 44205245453501 |
7 | 4313512525330 |
oct | 713733545515 |
9 | 186303070621 |
10 | 61730638669 |
11 | 241a8377557 |
12 | bb69571291 |
13 | 5a8a17333b |
14 | 2db8672617 |
15 | 1914659914 |
hex | e5f6ecb4d |
61730638669 has 4 divisors (see below), whose sum is σ = 70549301344. Its totient is φ = 52911975996.
The previous prime is 61730638661. The next prime is 61730638687. The reversal of 61730638669 is 96683603716.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 61730638669 - 23 = 61730638661 is a prime.
It is a super-2 number, since 2×617306386692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61730638661) 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 3 ways as a sum of consecutive naturals, for example, 4409331327 + ... + 4409331340.
It is an arithmetic number, because the mean of its divisors is an integer number (17637325336).
Almost surely, 261730638669 is an apocalyptic number.
It is an amenable number.
61730638669 is a deficient number, since it is larger than the sum of its proper divisors (8818662675).
61730638669 is an equidigital number, since it uses as much as digits as its factorization.
61730638669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8818662674.
The product of its (nonzero) digits is 5878656, while the sum is 55.
The spelling of 61730638669 in words is "sixty-one billion, seven hundred thirty million, six hundred thirty-eight thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •