Base | Representation |
---|---|
bin | 10000110010100110… |
… | …10010110100011111 |
3 | 212021020020010101200 |
4 | 20121103102310133 |
5 | 121430143012230 |
6 | 4050254210543 |
7 | 436246221036 |
oct | 103123226437 |
9 | 25236203350 |
10 | 9014422815 |
11 | 3906452312 |
12 | 18b6ab3a53 |
13 | b0875ccc8 |
14 | 6172cb71d |
15 | 37b5ca160 |
hex | 2194d2d1f |
9014422815 has 24 divisors (see below), whose sum is σ = 15627351168. Its totient is φ = 4806968640.
The previous prime is 9014422801. The next prime is 9014422819. The reversal of 9014422815 is 5182244109.
9014422815 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 9014422815 - 24 = 9014422799 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9014422815.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9014422819) 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 23 ways as a sum of consecutive naturals, for example, 434785 + ... + 455045.
It is an arithmetic number, because the mean of its divisors is an integer number (651139632).
Almost surely, 29014422815 is an apocalyptic number.
9014422815 is a deficient number, since it is larger than the sum of its proper divisors (6612928353).
9014422815 is a wasteful number, since it uses less digits than its factorization.
9014422815 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30159 (or 30156 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 9014422815 is about 94944.3142847427. The cubic root of 9014422815 is about 2081.1943657449.
The spelling of 9014422815 in words is "nine billion, fourteen million, four hundred twenty-two thousand, eight hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •