Base | Representation |
---|---|
bin | 100100011010110111101… |
… | …0100101101100000100101 |
3 | 122201112002012222210012000 |
4 | 1020311233110231200211 |
5 | 1124002233134200401 |
6 | 14351255211115513 |
7 | 1024431033043005 |
oct | 110655724554045 |
9 | 18645065883160 |
10 | 5005504600101 |
11 | 165a905943045 |
12 | 68a125442b99 |
13 | 2a402b6289a5 |
14 | 1343a687a005 |
15 | 8a310aee186 |
hex | 48d6f52d825 |
5005504600101 has 32 divisors (see below), whose sum is σ = 7759899083520. Its totient is φ = 3182873582592.
The previous prime is 5005504600081. The next prime is 5005504600123. The reversal of 5005504600101 is 1010064055005.
It is a happy number.
5005504600101 is a `hidden beast` number, since 5 + 0 + 0 + 5 + 50 + 4 + 600 + 1 + 0 + 1 = 666.
It is not a de Polignac number, because 5005504600101 - 217 = 5005504469029 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005504601101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11197776 + ... + 11636201.
It is an arithmetic number, because the mean of its divisors is an integer number (242496846360).
Almost surely, 25005504600101 is an apocalyptic number.
It is an amenable number.
5005504600101 is a deficient number, since it is larger than the sum of its proper divisors (2754394483419).
5005504600101 is a wasteful number, since it uses less digits than its factorization.
5005504600101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22834362 (or 22834356 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 5005504600101 its reverse (1010064055005), we get a palindrome (6015568655106).
The spelling of 5005504600101 in words is "five trillion, five billion, five hundred four million, six hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •