Base | Representation |
---|---|
bin | 101000000011011101110… |
… | …1110000000001100101101 |
3 | 201111021101002102102102212 |
4 | 1100012323232000030231 |
5 | 1210143221120130010 |
6 | 15412544020500205 |
7 | 1105503044141303 |
oct | 120067356001455 |
9 | 21437332372385 |
10 | 5505002505005 |
11 | 1832727443013 |
12 | 74aaa624a665 |
13 | 30c172739b73 |
14 | 15062d120273 |
15 | 982e7603505 |
hex | 501bbb8032d |
5505002505005 has 32 divisors (see below), whose sum is σ = 7111202541408. Its totient is φ = 4075877376000.
The previous prime is 5505002504957. The next prime is 5505002505007. The reversal of 5505002505005 is 5005052005055.
It can be written as a sum of positive squares in 16 ways, for example, as 3791537212969 + 1713465292036 = 1947187^2 + 1308994^2 .
It is not a de Polignac number, because 5505002505005 - 26 = 5505002504941 is a prime.
It is a super-2 number, since 2×55050025050052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5505002505007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19046249 + ... + 19333121.
It is an arithmetic number, because the mean of its divisors is an integer number (222225079419).
Almost surely, 25505002505005 is an apocalyptic number.
It is an amenable number.
5505002505005 is a deficient number, since it is larger than the sum of its proper divisors (1606200036403).
5505002505005 is a wasteful number, since it uses less digits than its factorization.
5505002505005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290657.
The product of its (nonzero) digits is 31250, while the sum is 32.
The spelling of 5505002505005 in words is "five trillion, five hundred five billion, two million, five hundred five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •