Base | Representation |
---|---|
bin | 1000111100000101111… |
… | …01101100011000000000 |
3 | 1002100210002212221200010 |
4 | 10132002331230120000 |
5 | 20013010302414030 |
6 | 353033105424520 |
7 | 31122132656244 |
oct | 4360275543000 |
9 | 1070702787603 |
10 | 307139888640 |
11 | 109291507312 |
12 | 4b63863b140 |
13 | 22c6a1032a0 |
14 | 10c194b4424 |
15 | 7ec940b6b0 |
hex | 4782f6c600 |
307139888640 has 320 divisors, whose sum is σ = 1065787785216. Its totient is φ = 75005263872.
The previous prime is 307139888603. The next prime is 307139888663. The reversal of 307139888640 is 46888931703.
It is a tau number, because it is divible by the number of its divisors (320).
It is a super-2 number, since 2×3071398886402 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12667569 + ... + 12691791.
Almost surely, 2307139888640 is an apocalyptic number.
307139888640 is a gapful number since it is divisible by the number (30) 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 307139888640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (532893892608).
307139888640 is an abundant number, since it is smaller than the sum of its proper divisors (758647896576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
307139888640 is a wasteful number, since it uses less digits than its factorization.
307139888640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24389 (or 24373 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 57.
The spelling of 307139888640 in words is "three hundred seven billion, one hundred thirty-nine million, eight hundred eighty-eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •