Base | Representation |
---|---|
bin | 1000001111001011110011… |
… | …1001011101100110000000 |
3 | 1012001211121010112211021212 |
4 | 2003302330321131212000 |
5 | 2141342123310140000 |
6 | 31132413214105252 |
7 | 1623225626552021 |
oct | 203627471354600 |
9 | 35054533484255 |
10 | 9056960240000 |
11 | 2982042a39542 |
12 | 10233717ab228 |
13 | 5090b592410a |
14 | 234505982c48 |
15 | 10a8d4134c35 |
hex | 83cbce5d980 |
9056960240000 has 320 divisors, whose sum is σ = 23651125217280. Its totient is φ = 3446995200000.
The previous prime is 9056960239961. The next prime is 9056960240017. The reversal of 9056960240000 is 420696509.
It is a tau number, because it is divible by the number of its divisors (320).
It is a self number, because there is not a number n which added to its sum of digits gives 9056960240000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 351427115 + ... + 351452885.
It is an arithmetic number, because the mean of its divisors is an integer number (73909766304).
Almost surely, 29056960240000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 9056960240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11825562608640).
9056960240000 is an abundant number, since it is smaller than the sum of its proper divisors (14594164977280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9056960240000 is a wasteful number, since it uses less digits than its factorization.
9056960240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26019 (or 25992 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 9056960240000 in words is "nine trillion, fifty-six billion, nine hundred sixty million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •