Base | Representation |
---|---|
bin | 1101000000100011… |
… | …10101011001111000 |
3 | 200000201121210212100 |
4 | 12200101311121320 |
5 | 103300400401143 |
6 | 3113003143400 |
7 | 335032665300 |
oct | 64021653170 |
9 | 20021553770 |
10 | 6983997048 |
11 | 2a64314396 |
12 | 142ab14b60 |
13 | 873bc1c42 |
14 | 4a3792600 |
15 | 2ad2076d3 |
hex | 1a0475678 |
6983997048 has 288 divisors, whose sum is σ = 23709628800. Its totient is φ = 1845680256.
The previous prime is 6983997043. The next prime is 6983997071. The reversal of 6983997048 is 8407993896.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6983997043) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2881165 + ... + 2883587.
It is an arithmetic number, because the mean of its divisors is an integer number (82325100).
Almost surely, 26983997048 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 6983997048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11854814400).
6983997048 is an abundant number, since it is smaller than the sum of its proper divisors (16725631752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6983997048 is a wasteful number, since it uses less digits than its factorization.
6983997048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2511 (or 2497 counting only the distinct ones).
The product of its (nonzero) digits is 23514624, while the sum is 63.
The square root of 6983997048 is about 83570.3120013321. The cubic root of 6983997048 is about 1911.4723302144.
The spelling of 6983997048 in words is "six billion, nine hundred eighty-three million, nine hundred ninety-seven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •