Base | Representation |
---|---|
bin | 11000011001110011100000 |
3 | 110001000020120 |
4 | 120121303200 |
5 | 3114202102 |
6 | 345040240 |
7 | 105242406 |
oct | 30316340 |
9 | 13030216 |
10 | 6397152 |
11 | 367a303 |
12 | 2186080 |
13 | 142c9c8 |
14 | bc7476 |
15 | 8656bc |
hex | 619ce0 |
6397152 has 48 divisors (see below), whose sum is σ = 17255952. Its totient is φ = 2073600.
The previous prime is 6397147. The next prime is 6397211. The reversal of 6397152 is 2517936.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×63971522 = 81847107422208, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2652 + ... + 4452.
It is an arithmetic number, because the mean of its divisors is an integer number (359499).
Almost surely, 26397152 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 6397152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8627976).
6397152 is an abundant number, since it is smaller than the sum of its proper divisors (10858800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6397152 is a wasteful number, since it uses less digits than its factorization.
6397152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1851 (or 1843 counting only the distinct ones).
The product of its digits is 11340, while the sum is 33.
The square root of 6397152 is about 2529.2591800763. The cubic root of 6397152 is about 185.6360091646.
The spelling of 6397152 in words is "six million, three hundred ninety-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •