Base | Representation |
---|---|
bin | 1011111011101111… |
… | …11001011000100000 |
3 | 121112111110202022100 |
4 | 11331313321120200 |
5 | 101110113203011 |
6 | 2535423210400 |
7 | 314523444213 |
oct | 57567713040 |
9 | 17474422270 |
10 | 6406772256 |
11 | 2798501905 |
12 | 12a9746a00 |
13 | 7b143ba01 |
14 | 44ac5777a |
15 | 2776d7d56 |
hex | 17ddf9620 |
6406772256 has 72 divisors (see below), whose sum is σ = 18256767984. Its totient is φ = 2131194240.
The previous prime is 6406772231. The next prime is 6406772261. The reversal of 6406772256 is 6522776046.
It is a tau number, because it is divible by the number of its divisors (72).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 118755 + ... + 164061.
It is an arithmetic number, because the mean of its divisors is an integer number (253566222).
Almost surely, 26406772256 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 6406772256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9128383992).
6406772256 is an abundant number, since it is smaller than the sum of its proper divisors (11849995728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6406772256 is a wasteful number, since it uses less digits than its factorization.
6406772256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45814 (or 45803 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 45.
The square root of 6406772256 is about 80042.3154087886. The cubic root of 6406772256 is about 1857.2901781718.
The spelling of 6406772256 in words is "six billion, four hundred six million, seven hundred seventy-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •