Base | Representation |
---|---|
bin | 100100011010111010100… |
… | …0010111010111111110011 |
3 | 122201112022220122002100201 |
4 | 1020311311002322333303 |
5 | 1124002432223200201 |
6 | 14351312520500031 |
7 | 1024433310035152 |
oct | 110656502727763 |
9 | 18645286562321 |
10 | 5005600600051 |
11 | 165a955052247 |
12 | 68a15161a617 |
13 | 2a404549b8ac |
14 | 1343b5509599 |
15 | 8a319263801 |
hex | 48d750baff3 |
5005600600051 has 8 divisors (see below), whose sum is σ = 5007864276944. Its totient is φ = 5003337185280.
The previous prime is 5005600600043. The next prime is 5005600600061. The reversal of 5005600600051 is 1500060065005.
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 5005600600051 - 23 = 5005600600043 is a prime.
It is a super-2 number, since 2×50056006000512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5005600599992 and 5005600600019.
It is not an unprimeable number, because it can be changed into a prime (5005600600001) 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, 45003016 + ... + 45114106.
It is an arithmetic number, because the mean of its divisors is an integer number (625983034618).
Almost surely, 25005600600051 is an apocalyptic number.
5005600600051 is a deficient number, since it is larger than the sum of its proper divisors (2263676893).
5005600600051 is a wasteful number, since it uses less digits than its factorization.
5005600600051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131061.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 5005600600051 its reverse (1500060065005), we get a palindrome (6505660665056).
The spelling of 5005600600051 in words is "five trillion, five billion, six hundred million, six hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •