Base | Representation |
---|---|
bin | 1011111011001011… |
… | …00011110011000000 |
3 | 121112011102112100000 |
4 | 11331211203303000 |
5 | 101102400341443 |
6 | 2535132200000 |
7 | 314434543500 |
oct | 57545436300 |
9 | 17464375300 |
10 | 6401965248 |
11 | 2795819278 |
12 | 12a8009000 |
13 | 7b0447a23 |
14 | 44a365a00 |
15 | 2770888d3 |
hex | 17d963cc0 |
6401965248 has 504 divisors, whose sum is σ = 22935005184. Its totient is φ = 1763596800.
The previous prime is 6401965243. The next prime is 6401965261. The reversal of 6401965248 is 8425691046.
It is a tau number, because it is divible by the number of its divisors (504).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6401965243) by changing a digit.
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 71 ways as a sum of consecutive naturals, for example, 23623353 + ... + 23623623.
Almost surely, 26401965248 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 6401965248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11467502592).
6401965248 is an abundant number, since it is smaller than the sum of its proper divisors (16533039936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6401965248 is a wasteful number, since it uses less digits than its factorization.
6401965248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343 (or 314 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The square root of 6401965248 is about 80012.2818572249. The cubic root of 6401965248 is about 1856.8255530211.
The spelling of 6401965248 in words is "six billion, four hundred one million, nine hundred sixty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •