Base | Representation |
---|---|
bin | 1011111110110010… |
… | …01100100100001100 |
3 | 121121021110121201000 |
4 | 11333121030210030 |
5 | 101133130410141 |
6 | 2542134020300 |
7 | 315253316256 |
oct | 57731144414 |
9 | 17537417630 |
10 | 6432278796 |
11 | 2800943299 |
12 | 12b61a7690 |
13 | 7b67cc638 |
14 | 4503b6cd6 |
15 | 279a755b6 |
hex | 17f64c90c |
6432278796 has 96 divisors (see below), whose sum is σ = 16948915200. Its totient is φ = 2109179520.
The previous prime is 6432278789. The next prime is 6432278849. The reversal of 6432278796 is 6978722346.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5696760 + ... + 5697888.
It is an arithmetic number, because the mean of its divisors is an integer number (176551200).
Almost surely, 26432278796 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 6432278796, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8474457600).
6432278796 is an abundant number, since it is smaller than the sum of its proper divisors (10516636404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6432278796 is a wasteful number, since it uses less digits than its factorization.
6432278796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1956 (or 1948 counting only the distinct ones).
The product of its digits is 6096384, while the sum is 54.
The square root of 6432278796 is about 80201.4887392996. The cubic root of 6432278796 is about 1859.7516525861.
The spelling of 6432278796 in words is "six billion, four hundred thirty-two million, two hundred seventy-eight thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •