Base | Representation |
---|---|
bin | 1011111101110111… |
… | …10000010101101000 |
3 | 121120201221111212201 |
4 | 11332323300111220 |
5 | 101124141423000 |
6 | 2541300345544 |
7 | 315130603354 |
oct | 57673602550 |
9 | 17521844781 |
10 | 6424561000 |
11 | 27a7551850 |
12 | 12b36a52b4 |
13 | 7b50297b0 |
14 | 44d368464 |
15 | 27904d96a |
hex | 17eef0568 |
6424561000 has 128 divisors (see below), whose sum is σ = 17662095360. Its totient is φ = 2156448000.
The previous prime is 6424560983. The next prime is 6424561019. The reversal of 6424561000 is 1654246.
It is a self number, because there is not a number n which added to its sum of digits gives 6424561000.
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 31 ways as a sum of consecutive naturals, for example, 120537 + ... + 165463.
It is an arithmetic number, because the mean of its divisors is an integer number (137985120).
Almost surely, 26424561000 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 6424561000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8831047680).
6424561000 is an abundant number, since it is smaller than the sum of its proper divisors (11237534360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6424561000 is a wasteful number, since it uses less digits than its factorization.
6424561000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44972 (or 44958 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 6424561000 is about 80153.3592558665. The cubic root of 6424561000 is about 1859.0075446929.
The spelling of 6424561000 in words is "six billion, four hundred twenty-four million, five hundred sixty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •