Base | Representation |
---|---|
bin | 1011111011011011… |
… | …10001111011011000 |
3 | 121112022111000111000 |
4 | 11331231301323120 |
5 | 101103423322110 |
6 | 2535250305000 |
7 | 314462060415 |
oct | 57555617330 |
9 | 17468430430 |
10 | 6404120280 |
11 | 2796a60398 |
12 | 12a8888160 |
13 | 7b0a208ac |
14 | 44a76710c |
15 | 2773621c0 |
hex | 17db71ed8 |
6404120280 has 128 divisors (see below), whose sum is σ = 21465662400. Its totient is φ = 1698330240.
The previous prime is 6404120279. The next prime is 6404120329. The reversal of 6404120280 is 820214046.
6404120280 is a `hidden beast` number, since 640 + 4 + 12 + 0 + 2 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35381790 + ... + 35381970.
Almost surely, 26404120280 is an apocalyptic number.
6404120280 is a gapful number since it is divisible by the number (60) 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 6404120280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10732831200).
6404120280 is an abundant number, since it is smaller than the sum of its proper divisors (15061542120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6404120280 is an frugal number, since it uses more digits than its factorization.
6404120280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 6404120280 is about 80025.7476066297. The cubic root of 6404120280 is about 1857.0338780909.
The spelling of 6404120280 in words is "six billion, four hundred four million, one hundred twenty thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •