Base | Representation |
---|---|
bin | 101000000001001010010… |
… | …0001111000110111001001 |
3 | 201110210120221111200001010 |
4 | 1100002110201320313021 |
5 | 1210103100303104010 |
6 | 15410404344314133 |
7 | 1105236240026403 |
oct | 120022441706711 |
9 | 21423527450033 |
10 | 5500050050505 |
11 | 183061595a70a |
12 | 749b43772949 |
13 | 30b8636b740a |
14 | 1502bd4b7b73 |
15 | 9810793e620 |
hex | 50094878dc9 |
5500050050505 has 64 divisors (see below), whose sum is σ = 9091488764160. Its totient is φ = 2837174501376.
The previous prime is 5500050050503. The next prime is 5500050050519. The reversal of 5500050050505 is 5050500500055.
It is not a de Polignac number, because 5500050050505 - 21 = 5500050050503 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5500050050503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 364886649 + ... + 364901721.
It is an arithmetic number, because the mean of its divisors is an integer number (142054511940).
Almost surely, 25500050050505 is an apocalyptic number.
It is an amenable number.
5500050050505 is a deficient number, since it is larger than the sum of its proper divisors (3591438713655).
5500050050505 is a wasteful number, since it uses less digits than its factorization.
5500050050505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18970.
The product of its (nonzero) digits is 15625, while the sum is 30.
The spelling of 5500050050505 in words is "five trillion, five hundred billion, fifty million, fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •