Base | Representation |
---|---|
bin | 11001111011101010000000 |
3 | 110210101001000 |
4 | 121323222000 |
5 | 3220013302 |
6 | 401412000 |
7 | 111532050 |
oct | 31735200 |
9 | 13711030 |
10 | 6797952 |
11 | 3923447 |
12 | 233a000 |
13 | 1540275 |
14 | c8d560 |
15 | 8e431c |
hex | 67ba80 |
6797952 has 128 divisors (see below), whose sum is σ = 23011200. Its totient is φ = 1935360.
The previous prime is 6797951. The next prime is 6797957. The reversal of 6797952 is 2597976.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 6797898 and 6797907.
It is not an unprimeable number, because it can be changed into a prime (6797951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24052 + ... + 24332.
It is an arithmetic number, because the mean of its divisors is an integer number (179775).
Almost surely, 26797952 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 6797952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11505600).
6797952 is an abundant number, since it is smaller than the sum of its proper divisors (16213248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6797952 is a wasteful number, since it uses less digits than its factorization.
6797952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311 (or 293 counting only the distinct ones).
The product of its digits is 238140, while the sum is 45.
The square root of 6797952 is about 2607.2882464354. The cubic root of 6797952 is about 189.4346258671.
The spelling of 6797952 in words is "six million, seven hundred ninety-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •