Base | Representation |
---|---|
bin | 101010001011001000… |
… | …0010010000000000000 |
3 | 22122202211001211200112 |
4 | 1110112100102000000 |
5 | 2440440311230000 |
6 | 105334535410452 |
7 | 6354231402200 |
oct | 1242620220000 |
9 | 278684054615 |
10 | 90567680000 |
11 | 35456104516 |
12 | 15676b23a28 |
13 | 8704612bc5 |
14 | 4552470400 |
15 | 2551113235 |
hex | 1516412000 |
90567680000 has 630 divisors, whose sum is σ = 277871686191. Its totient is φ = 29417472000.
The previous prime is 90567679999. The next prime is 90567680029. The reversal of 90567680000 is 8676509.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 3 ways, for example, as 20939247616 + 69628432384 = 144704^2 + 263872^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=212800.
It is a self number, because there is not a number n which added to its sum of digits gives 90567680000.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 4766719991 + ... + 4766720009.
Almost surely, 290567680000 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 90567680000
90567680000 is an abundant number, since it is smaller than the sum of its proper divisors (187304006191).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90567680000 is an frugal number, since it uses more digits than its factorization.
90567680000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98 (or 33 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 41.
The spelling of 90567680000 in words is "ninety billion, five hundred sixty-seven million, six hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •