Base | Representation |
---|---|
bin | 100100011010110111101… |
… | …1010011011101100100101 |
3 | 122201112002022210222200000 |
4 | 1020311233122123230211 |
5 | 1124002234030200010 |
6 | 14351255303211513 |
7 | 1024431051560625 |
oct | 110655732335445 |
9 | 18645068728600 |
10 | 5005506100005 |
11 | 165a906777a34 |
12 | 68a125a46b99 |
13 | 2a402ba325c8 |
14 | 1343a6b4a885 |
15 | 8a310ce87c0 |
hex | 48d6f69bb25 |
5005506100005 has 24 divisors (see below), whose sum is σ = 8997551707872. Its totient is φ = 2669603252688.
The previous prime is 5005506100003. The next prime is 5005506100099. The reversal of 5005506100005 is 5000016055005.
5005506100005 is a `hidden beast` number, since 5 + 0 + 0 + 550 + 6 + 100 + 0 + 0 + 5 = 666.
It is not a de Polignac number, because 5005506100005 - 21 = 5005506100003 is a prime.
It is a super-2 number, since 2×50055061000052 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005506100003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2059877839 + ... + 2059880268.
It is an arithmetic number, because the mean of its divisors is an integer number (374897987828).
Almost surely, 25005506100005 is an apocalyptic number.
It is an amenable number.
5005506100005 is a deficient number, since it is larger than the sum of its proper divisors (3992045607867).
5005506100005 is an equidigital number, since it uses as much as digits as its factorization.
5005506100005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4119758127 (or 4119758115 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 5005506100005 in words is "five trillion, five billion, five hundred six million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •