Base | Representation |
---|---|
bin | 1100000010000111… |
… | …10000010100111100 |
3 | 121200020000210121010 |
4 | 12001003300110330 |
5 | 101212303300130 |
6 | 2545012435220 |
7 | 316042620615 |
oct | 60103602474 |
9 | 17606023533 |
10 | 6460212540 |
11 | 2815692331 |
12 | 1303618b10 |
13 | 7bc52cc92 |
14 | 453da8c0c |
15 | 27c2420b0 |
hex | 1810f053c |
6460212540 has 48 divisors (see below), whose sum is σ = 18155884320. Its totient is φ = 1716314880.
The previous prime is 6460212527. The next prime is 6460212581. The reversal of 6460212540 is 452120646.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 6460212498 and 6460212507.
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 15 ways as a sum of consecutive naturals, for example, 183991 + ... + 216270.
It is an arithmetic number, because the mean of its divisors is an integer number (378247590).
Almost surely, 26460212540 is an apocalyptic number.
6460212540 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6460212540 is an abundant number, since it is smaller than the sum of its proper divisors (11695671780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6460212540 is a wasteful number, since it uses less digits than its factorization.
6460212540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400542 (or 400540 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The square root of 6460212540 is about 80375.4473704501. The cubic root of 6460212540 is about 1862.4399070142.
The spelling of 6460212540 in words is "six billion, four hundred sixty million, two hundred twelve thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •