Base | Representation |
---|---|
bin | 1100000110100001… |
… | …00101010001000100 |
3 | 121202210111101012102 |
4 | 12003100211101010 |
5 | 101301231121130 |
6 | 2552412011232 |
7 | 320001455426 |
oct | 60320452104 |
9 | 17683441172 |
10 | 6497129540 |
11 | 2834507650 |
12 | 1313a60b18 |
13 | 7c7087465 |
14 | 458c58816 |
15 | 2805d5645 |
hex | 183425444 |
6497129540 has 48 divisors (see below), whose sum is σ = 14889813120. Its totient is φ = 2361722880.
The previous prime is 6497129519. The next prime is 6497129543. The reversal of 6497129540 is 459217946.
It is a super-2 number, since 2×64971295402 = 84425384519081223200, which contains 22 as substring.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (6497129543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1163876 + ... + 1169444.
It is an arithmetic number, because the mean of its divisors is an integer number (310204440).
Almost surely, 26497129540 is an apocalyptic number.
It is an amenable number.
6497129540 is an abundant number, since it is smaller than the sum of its proper divisors (8392683580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6497129540 is a wasteful number, since it uses less digits than its factorization.
6497129540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10892 (or 10890 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 47.
The square root of 6497129540 is about 80604.7736799751. The cubic root of 6497129540 is about 1865.9808193958.
The spelling of 6497129540 in words is "six billion, four hundred ninety-seven million, one hundred twenty-nine thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •