Base | Representation |
---|---|
bin | 101011101110010110011… |
… | …1101100111100101001001 |
3 | 210021111100100212212000222 |
4 | 1113130230331213211021 |
5 | 1241424234340110023 |
6 | 20440404141035425 |
7 | 1160110604525654 |
oct | 127345475474511 |
9 | 23244310785028 |
10 | 6009413597513 |
11 | 1a0763a346607 |
12 | 8107b8555b75 |
13 | 3478ba702841 |
14 | 16ac0010889b |
15 | a64ba611cc8 |
hex | 5772cf67949 |
6009413597513 has 8 divisors (see below), whose sum is σ = 6027342093696. Its totient is φ = 5991506283600.
The previous prime is 6009413597497. The next prime is 6009413597533. The reversal of 6009413597513 is 3157953149006.
6009413597513 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6009413597513 - 24 = 6009413597497 is a prime.
It is a super-2 number, since 2×60094135975132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6009413597533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4727231 + ... + 5862212.
It is an arithmetic number, because the mean of its divisors is an integer number (753417761712).
Almost surely, 26009413597513 is an apocalyptic number.
It is an amenable number.
6009413597513 is a deficient number, since it is larger than the sum of its proper divisors (17928496183).
6009413597513 is a wasteful number, since it uses less digits than its factorization.
6009413597513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10591135.
The product of its (nonzero) digits is 3061800, while the sum is 53.
The spelling of 6009413597513 in words is "six trillion, nine billion, four hundred thirteen million, five hundred ninety-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •