Base | Representation |
---|---|
bin | 10111111011000001010000 |
3 | 102210121021100 |
4 | 113323001100 |
5 | 3101133211 |
6 | 342224400 |
7 | 104205651 |
oct | 27730120 |
9 | 12717240 |
10 | 6271056 |
11 | 35a35a0 |
12 | 2125100 |
13 | 13b74ac |
14 | b93528 |
15 | 83d156 |
hex | 5fb050 |
6271056 has 120 divisors (see below), whose sum is σ = 19846944. Its totient is φ = 1831680.
The previous prime is 6271049. The next prime is 6271063. The reversal of 6271056 is 6501726.
It is an interprime number because it is at equal distance from previous prime (6271049) and next prime (6271063).
It is a super-2 number, since 2×62710562 = 78652286710272, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 58555 + ... + 58661.
Almost surely, 26271056 is an apocalyptic number.
6271056 is a gapful number since it is divisible by the number (66) 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 6271056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9923472).
6271056 is an abundant number, since it is smaller than the sum of its proper divisors (13575888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6271056 is a wasteful number, since it uses less digits than its factorization.
6271056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169 (or 160 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 6271056 is about 2504.2076591209. The cubic root of 6271056 is about 184.4081989820.
The spelling of 6271056 in words is "six million, two hundred seventy-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •