Base | Representation |
---|---|
bin | 10001101010110001… |
… | …11100011000111001 |
3 | 220111001221202022101 |
4 | 20311120330120321 |
5 | 123411312301344 |
6 | 4205130423401 |
7 | 454030554322 |
oct | 106530743071 |
9 | 26431852271 |
10 | 9485665849 |
11 | 4028458170 |
12 | 1a08891b61 |
13 | b82286b3a |
14 | 65db19449 |
15 | 3a7b629d4 |
hex | 23563c639 |
9485665849 has 8 divisors (see below), whose sum is σ = 10892630880. Its totient is φ = 8169472800.
The previous prime is 9485665759. The next prime is 9485665897.
9485665849 is nontrivially palindromic in base 10.
9485665849 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 9485665849 - 211 = 9485663801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9485665649) 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 7 ways as a sum of consecutive naturals, for example, 22692772 + ... + 22693189.
It is an arithmetic number, because the mean of its divisors is an integer number (1361578860).
Almost surely, 29485665849 is an apocalyptic number.
It is an amenable number.
9485665849 is a deficient number, since it is larger than the sum of its proper divisors (1406965031).
9485665849 is a wasteful number, since it uses less digits than its factorization.
9485665849 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45385991.
The product of its digits is 74649600, while the sum is 64.
The square root of 9485665849 is about 97394.3830464570. The cubic root of 9485665849 is about 2116.8460465444.
The spelling of 9485665849 in words is "nine billion, four hundred eighty-five million, six hundred sixty-five thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •