Base | Representation |
---|---|
bin | 100100011010111010100… |
… | …0010111010111111010111 |
3 | 122201112022220122002022200 |
4 | 1020311311002322333113 |
5 | 1124002432223200043 |
6 | 14351312520455543 |
7 | 1024433310035112 |
oct | 110656502727727 |
9 | 18645286562280 |
10 | 5005600600023 |
11 | 165a955052221 |
12 | 68a15161a5b3 |
13 | 2a404549b88a |
14 | 1343b5509579 |
15 | 8a3192637d3 |
hex | 48d750bafd7 |
5005600600023 has 12 divisors (see below), whose sum is σ = 7655624447328. Its totient is φ = 3140769003840.
The previous prime is 5005600600001. The next prime is 5005600600043. The reversal of 5005600600023 is 3200060065005.
5005600600023 is a `hidden beast` number, since 5 + 0 + 0 + 56 + 0 + 0 + 600 + 0 + 2 + 3 = 666.
It is a de Polignac number, because none of the positive numbers 2k-5005600600023 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5005600600023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005600600043) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16358171743 + ... + 16358172048.
It is an arithmetic number, because the mean of its divisors is an integer number (637968703944).
Almost surely, 25005600600023 is an apocalyptic number.
5005600600023 is a deficient number, since it is larger than the sum of its proper divisors (2650023847305).
5005600600023 is a wasteful number, since it uses less digits than its factorization.
5005600600023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32716343814 (or 32716343811 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 5005600600023 its reverse (3200060065005), we get a palindrome (8205660665028).
The spelling of 5005600600023 in words is "five trillion, five billion, six hundred million, six hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •