Base | Representation |
---|---|
bin | 10010001001011011… |
… | …01001000001000001 |
3 | 221010222200222010202 |
4 | 21010231221001001 |
5 | 124423120443021 |
6 | 4250432534545 |
7 | 463302002153 |
oct | 110455510101 |
9 | 27128628122 |
10 | 9742749761 |
11 | 414a58a108 |
12 | 1a7a9b1455 |
13 | bc36099b4 |
14 | 685d1aad3 |
15 | 3c04e5a0b |
hex | 244b69041 |
9742749761 has 4 divisors (see below), whose sum is σ = 9743001024. Its totient is φ = 9742498500.
The previous prime is 9742749713. The next prime is 9742749889. The reversal of 9742749761 is 1679472479.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1679472479 = 47 ⋅35733457.
It is a cyclic number.
It is not a de Polignac number, because 9742749761 - 26 = 9742749697 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 9742749697 and 9742749706.
It is not an unprimeable number, because it can be changed into a prime (9742749061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53765 + ... + 149586.
It is an arithmetic number, because the mean of its divisors is an integer number (2435750256).
Almost surely, 29742749761 is an apocalyptic number.
It is an amenable number.
9742749761 is a deficient number, since it is larger than the sum of its proper divisors (251263).
9742749761 is a wasteful number, since it uses less digits than its factorization.
9742749761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251262.
The product of its digits is 5334336, while the sum is 56.
The square root of 9742749761 is about 98705.3684507585. The cubic root of 9742749761 is about 2135.7996745534.
The spelling of 9742749761 in words is "nine billion, seven hundred forty-two million, seven hundred forty-nine thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •