Base | Representation |
---|---|
bin | 100100011100110011000… |
… | …1010100100100111000001 |
3 | 122201220202211121100122001 |
4 | 1020321212022210213001 |
5 | 1124034223323231221 |
6 | 14353222145544001 |
7 | 1024635460453051 |
oct | 110714612444701 |
9 | 18656684540561 |
10 | 5009645914561 |
11 | 1661640576982 |
12 | 68aaa0345001 |
13 | 2a453b5c7b12 |
14 | 13467a897561 |
15 | 8a4a448a391 |
hex | 48e662a49c1 |
5009645914561 has 4 divisors (see below), whose sum is σ = 5131832400324. Its totient is φ = 4887459428800.
The previous prime is 5009645914529. The next prime is 5009645914591. The reversal of 5009645914561 is 1654195469005.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 313891267600 + 4695754646961 = 560260^2 + 2166969^2 .
It is a cyclic number.
It is not a de Polignac number, because 5009645914561 - 25 = 5009645914529 is a prime.
It is a super-2 number, since 2×50096459145612 (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 (5009645914591) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61093242820 + ... + 61093242901.
It is an arithmetic number, because the mean of its divisors is an integer number (1282958100081).
Almost surely, 25009645914561 is an apocalyptic number.
It is an amenable number.
5009645914561 is a deficient number, since it is larger than the sum of its proper divisors (122186485763).
5009645914561 is a wasteful number, since it uses less digits than its factorization.
5009645914561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122186485762.
The product of its (nonzero) digits is 5832000, while the sum is 55.
The spelling of 5009645914561 in words is "five trillion, nine billion, six hundred forty-five million, nine hundred fourteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •