Base | Representation |
---|---|
bin | 10010000111101111… |
… | …11010100101101001 |
3 | 221010000012102210112 |
4 | 21003313322211221 |
5 | 124411014302321 |
6 | 4245211024105 |
7 | 463041203420 |
oct | 110367724551 |
9 | 27100172715 |
10 | 9728665961 |
11 | 414263a803 |
12 | 1a7613b035 |
13 | bc07183a1 |
14 | 6840d22b7 |
15 | 3be162a5b |
hex | 243dfa969 |
9728665961 has 8 divisors (see below), whose sum is σ = 11128044864. Its totient is φ = 8331679440.
The previous prime is 9728665949. The next prime is 9728665967. The reversal of 9728665961 is 1695668279.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 9728665961 - 222 = 9724471657 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 9728665961.
It is not an unprimeable number, because it can be changed into a prime (9728665967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 589370 + ... + 605651.
It is an arithmetic number, because the mean of its divisors is an integer number (1391005608).
Almost surely, 29728665961 is an apocalyptic number.
It is an amenable number.
9728665961 is a deficient number, since it is larger than the sum of its proper divisors (1399378903).
9728665961 is a wasteful number, since it uses less digits than its factorization.
9728665961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196191.
The product of its digits is 9797760, while the sum is 59.
The square root of 9728665961 is about 98634.0000253462. Note that the first 4 decimals coincide. The cubic root of 9728665961 is about 2134.7700308986.
The spelling of 9728665961 in words is "nine billion, seven hundred twenty-eight million, six hundred sixty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •