Base | Representation |
---|---|
bin | 1101000010010110… |
… | …00000101110011110 |
3 | 200001202211022100000 |
4 | 12201023000232132 |
5 | 103313220020010 |
6 | 3114300315130 |
7 | 335304252630 |
oct | 64113005636 |
9 | 20052738300 |
10 | 6998985630 |
11 | 2a7182154a |
12 | 1433b42aa6 |
13 | 87703c320 |
14 | 4a5774a50 |
15 | 2ae6b87c0 |
hex | 1a12c0b9e |
6998985630 has 384 divisors, whose sum is σ = 23998980096. Its totient is φ = 1427673600.
The previous prime is 6998985613. The next prime is 6998985641. The reversal of 6998985630 is 365898996.
6998985630 is a `hidden beast` number, since 69 + 9 + 8 + 9 + 8 + 563 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 6854520 + ... + 6855540.
It is an arithmetic number, because the mean of its divisors is an integer number (62497344).
Almost surely, 26998985630 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6998985630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11999490048).
6998985630 is an abundant number, since it is smaller than the sum of its proper divisors (16999994466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6998985630 is a wasteful number, since it uses less digits than its factorization.
6998985630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094 (or 1082 counting only the distinct ones).
The product of its (nonzero) digits is 25194240, while the sum is 63.
The square root of 6998985630 is about 83659.9404135576. The cubic root of 6998985630 is about 1912.8387773562.
The spelling of 6998985630 in words is "six billion, nine hundred ninety-eight million, nine hundred eighty-five thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •