Base | Representation |
---|---|
bin | 111001001110000001… |
… | …101110000011011001 |
3 | 12212120202121001120202 |
4 | 321032001232003121 |
5 | 2001311241201034 |
6 | 44120254431545 |
7 | 4303335421526 |
oct | 711601560331 |
9 | 185522531522 |
10 | 61438615769 |
11 | 24068551413 |
12 | baa78025b5 |
13 | 5a4180941b |
14 | 2d8b97814d |
15 | 18e8bc447e |
hex | e4e06e0d9 |
61438615769 has 4 divisors (see below), whose sum is σ = 61552181220. Its totient is φ = 61325050320.
The previous prime is 61438615759. The next prime is 61438615781. The reversal of 61438615769 is 96751683416.
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 33811854400 + 27626761369 = 183880^2 + 166213^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61438615769 is a prime.
It is a super-2 number, since 2×614386157692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61438615759) 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, 56781914 + ... + 56782995.
It is an arithmetic number, because the mean of its divisors is an integer number (15388045305).
Almost surely, 261438615769 is an apocalyptic number.
It is an amenable number.
61438615769 is a deficient number, since it is larger than the sum of its proper divisors (113565451).
61438615769 is a wasteful number, since it uses less digits than its factorization.
61438615769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113565450.
The product of its digits is 6531840, while the sum is 56.
The spelling of 61438615769 in words is "sixty-one billion, four hundred thirty-eight million, six hundred fifteen thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •