Base | Representation |
---|---|
bin | 1100000000111010… |
… | …00011011000111000 |
3 | 121122111221100112101 |
4 | 12000131003120320 |
5 | 101202204121000 |
6 | 2544011153144 |
7 | 315560444026 |
oct | 60035033070 |
9 | 17574840471 |
10 | 6450067000 |
11 | 280a992893 |
12 | 13001457b4 |
13 | 7ba3ba0c0 |
14 | 4528c7716 |
15 | 27b3dae6a |
hex | 180743638 |
6450067000 has 128 divisors (see below), whose sum is σ = 16409615040. Its totient is φ = 2358796800.
The previous prime is 6450066989. The next prime is 6450067027. The reversal of 6450067000 is 7600546.
It is a self number, because there is not a number n which added to its sum of digits gives 6450067000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1388682 + ... + 1393318.
Almost surely, 26450067000 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 6450067000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8204807520).
6450067000 is an abundant number, since it is smaller than the sum of its proper divisors (9959548040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6450067000 is a wasteful number, since it uses less digits than its factorization.
6450067000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4778 (or 4764 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 6450067000 is about 80312.3091437421. The cubic root of 6450067000 is about 1861.4644303999.
Adding to 6450067000 its reverse (7600546), we get a palindrome (6457667546).
The spelling of 6450067000 in words is "six billion, four hundred fifty million, sixty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •