Base | Representation |
---|---|
bin | 10000110100110000… |
… | …11111000101110101 |
3 | 212022111100122022210 |
4 | 20122120133011311 |
5 | 121444313423023 |
6 | 4052143044033 |
7 | 436556334060 |
oct | 103230370565 |
9 | 25274318283 |
10 | 9032561013 |
11 | 3915710863 |
12 | 1900ba0619 |
13 | b0c440b78 |
14 | 61988d8d7 |
15 | 37ceae593 |
hex | 21a61f175 |
9032561013 has 8 divisors (see below), whose sum is σ = 13763902528. Its totient is φ = 5161463424.
The previous prime is 9032560991. The next prime is 9032561017. The reversal of 9032561013 is 3101652309.
9032561013 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 not a de Polignac number, because 9032561013 - 29 = 9032560501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9032561017) 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, 215060956 + ... + 215060997.
It is an arithmetic number, because the mean of its divisors is an integer number (1720487816).
Almost surely, 29032561013 is an apocalyptic number.
It is an amenable number.
9032561013 is a deficient number, since it is larger than the sum of its proper divisors (4731341515).
9032561013 is a wasteful number, since it uses less digits than its factorization.
9032561013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430121963.
The product of its (nonzero) digits is 4860, while the sum is 30.
The square root of 9032561013 is about 95039.7864738763. The cubic root of 9032561013 is about 2082.5893090043.
The spelling of 9032561013 in words is "nine billion, thirty-two million, five hundred sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •