Base | Representation |
---|---|
bin | 1000111011111010000… |
… | …11111111100010001000 |
3 | 1002100112012120121210111 |
4 | 10131331003333202020 |
5 | 20012304431023210 |
6 | 353015211324104 |
7 | 31116521250526 |
oct | 4357503774210 |
9 | 1070465517714 |
10 | 307040876680 |
11 | 10924063014a |
12 | 4b60b450634 |
13 | 22c52747425 |
14 | 10c0a29d316 |
15 | 7ec089e88a |
hex | 477d0ff888 |
307040876680 has 128 divisors (see below), whose sum is σ = 743281246080. Its totient is φ = 113741107200.
The previous prime is 307040876657. The next prime is 307040876683. The reversal of 307040876680 is 86678040703.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (307040876683) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11181127 + ... + 11208553.
It is an arithmetic number, because the mean of its divisors is an integer number (5806884735).
Almost surely, 2307040876680 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 307040876680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (371640623040).
307040876680 is an abundant number, since it is smaller than the sum of its proper divisors (436240369400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
307040876680 is a wasteful number, since it uses less digits than its factorization.
307040876680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27719 (or 27715 counting only the distinct ones).
The product of its (nonzero) digits is 1354752, while the sum is 49.
The spelling of 307040876680 in words is "three hundred seven billion, forty million, eight hundred seventy-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •