Base | Representation |
---|---|
bin | 10000110101101101… |
… | …10110001100010101 |
3 | 212100001022222221111 |
4 | 20122312312030111 |
5 | 122003333114312 |
6 | 4053025415021 |
7 | 440014103020 |
oct | 103266661425 |
9 | 25301288844 |
10 | 9040519957 |
11 | 391a1574a7 |
12 | 190379a471 |
13 | b10c996c1 |
14 | 61a9621b7 |
15 | 37da328a7 |
hex | 21adb6315 |
9040519957 has 16 divisors (see below), whose sum is σ = 10484232192. Its totient is φ = 7635000240.
The previous prime is 9040519931. The next prime is 9040519963. The reversal of 9040519957 is 7599150409.
9040519957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-9040519957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9040519957.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9040519927) 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 15 ways as a sum of consecutive naturals, for example, 923028 + ... + 932770.
It is an arithmetic number, because the mean of its divisors is an integer number (655264512).
Almost surely, 29040519957 is an apocalyptic number.
It is an amenable number.
9040519957 is a deficient number, since it is larger than the sum of its proper divisors (1443712235).
9040519957 is a wasteful number, since it uses less digits than its factorization.
9040519957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11688.
The product of its (nonzero) digits is 510300, while the sum is 49.
The square root of 9040519957 is about 95081.6488971452. The cubic root of 9040519957 is about 2083.2008131571.
The spelling of 9040519957 in words is "nine billion, forty million, five hundred nineteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •