Base | Representation |
---|---|
bin | 111100110110111100… |
… | …0110000101101000000 |
3 | 110111100012012201202100 |
4 | 1321231320300231000 |
5 | 4120124302134401 |
6 | 140012300150400 |
7 | 12304453620000 |
oct | 1715570605500 |
9 | 414305181670 |
10 | 130692614976 |
11 | 50476635000 |
12 | 213b4838400 |
13 | c42a529691 |
14 | 647b480000 |
15 | 35eda77b86 |
hex | 1e6de30b40 |
130692614976 has 840 divisors, whose sum is σ = 487454131008. Its totient is φ = 33468019200.
The previous prime is 130692614971. The next prime is 130692614989. The reversal of 130692614976 is 679416296031.
130692614976 is a `hidden beast` number, since 1 + 3 + 0 + 6 + 92 + 61 + 497 + 6 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130692614971) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 1840741021 + ... + 1840741091.
Almost surely, 2130692614976 is an apocalyptic number.
130692614976 is a gapful number since it is divisible by the number (16) 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 130692614976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (243727065504).
130692614976 is an abundant number, since it is smaller than the sum of its proper divisors (356761516032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130692614976 is an frugal number, since it uses more digits than its factorization.
130692614976 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150 (or 94 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 54.
The spelling of 130692614976 in words is "one hundred thirty billion, six hundred ninety-two million, six hundred fourteen thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •