Base | Representation |
---|---|
bin | 1100000100110001… |
… | …11011001000000110 |
3 | 121201210001002202120 |
4 | 12002120323020012 |
5 | 101234012222024 |
6 | 2551131150410 |
7 | 316433446440 |
oct | 60230731006 |
9 | 17653032676 |
10 | 6482539014 |
11 | 2827251566 |
12 | 130aba5406 |
13 | 7c4049303 |
14 | 456d3b490 |
15 | 27e1a2479 |
hex | 18263b206 |
6482539014 has 64 divisors (see below), whose sum is σ = 15226085376. Its totient is φ = 1801535904.
The previous prime is 6482538973. The next prime is 6482539067. The reversal of 6482539014 is 4109352846.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
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, 311689 + ... + 331835.
It is an arithmetic number, because the mean of its divisors is an integer number (237907584).
Almost surely, 26482539014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6482539014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7613042688).
6482539014 is an abundant number, since it is smaller than the sum of its proper divisors (8743546362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6482539014 is a wasteful number, since it uses less digits than its factorization.
6482539014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20369.
The product of its (nonzero) digits is 207360, while the sum is 42.
The square root of 6482539014 is about 80514.2162229752. The cubic root of 6482539014 is about 1864.5829689011.
The spelling of 6482539014 in words is "six billion, four hundred eighty-two million, five hundred thirty-nine thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •