Base | Representation |
---|---|
bin | 100110101001111111… |
… | …1100111100001000000 |
3 | 21221021100200000022020 |
4 | 1031103333213201000 |
5 | 2330002433030410 |
6 | 102045204441440 |
7 | 5666103440610 |
oct | 1152377474100 |
9 | 257240600266 |
10 | 83013564480 |
11 | 32229aa1740 |
12 | 141090a9280 |
13 | 7a9c588472 |
14 | 40370b2a40 |
15 | 225cd41a70 |
hex | 1353fe7840 |
83013564480 has 448 divisors, whose sum is σ = 331887697920. Its totient is φ = 17077248000.
The previous prime is 83013564479. The next prime is 83013564539. The reversal of 83013564480 is 8446531038.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7460361 + ... + 7471479.
Almost surely, 283013564480 is an apocalyptic number.
83013564480 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 83013564480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165943848960).
83013564480 is an abundant number, since it is smaller than the sum of its proper divisors (248874133440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
83013564480 is a wasteful number, since it uses less digits than its factorization.
83013564480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11258 (or 11248 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
The spelling of 83013564480 in words is "eighty-three billion, thirteen million, five hundred sixty-four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •