Base | Representation |
---|---|
bin | 101011001010000101… |
… | …0001010011111001100 |
3 | 22212020000210002122021 |
4 | 1112110022022133030 |
5 | 3004302040134310 |
6 | 110324314055524 |
7 | 6460461022621 |
oct | 1262412123714 |
9 | 285200702567 |
10 | 92680005580 |
11 | 3633a4a0a38 |
12 | 15b6641a5a4 |
13 | 8980127cb6 |
14 | 46b2c08348 |
15 | 26267b25da |
hex | 159428a7cc |
92680005580 has 48 divisors (see below), whose sum is σ = 203433177024. Its totient is φ = 35400273920.
The previous prime is 92680005577. The next prime is 92680005641. The reversal of 92680005580 is 8550008629.
It is a super-3 number, since 3×926800055803 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
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, 102900 + ... + 442660.
It is an arithmetic number, because the mean of its divisors is an integer number (4238191188).
Almost surely, 292680005580 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 92680005580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101716588512).
92680005580 is an abundant number, since it is smaller than the sum of its proper divisors (110753171444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
92680005580 is a wasteful number, since it uses less digits than its factorization.
92680005580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340386 (or 340384 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 43.
The spelling of 92680005580 in words is "ninety-two billion, six hundred eighty million, five thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •