Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …10011100010101010001 |
3 | 1221120202221012222002222 |
4 | 20000101202130111101 |
5 | 33003000303234010 |
6 | 1100404533350425 |
7 | 54511516220456 |
oct | 10002142342521 |
9 | 1846687188088 |
10 | 550050055505 |
11 | 1a2302a09a35 |
12 | 8a72a798415 |
13 | 3cb3c395232 |
14 | 1c8a046382d |
15 | e494ab4355 |
hex | 801189c551 |
550050055505 has 4 divisors (see below), whose sum is σ = 660060066612. Its totient is φ = 440040044400.
The previous prime is 550050055501. The next prime is 550050055517. The reversal of 550050055505 is 505550050055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 118581054736 + 431469000769 = 344356^2 + 656863^2 .
It is not a de Polignac number, because 550050055505 - 22 = 550050055501 is a prime.
It is a super-2 number, since 2×5500500555052 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550050055501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55005005546 + ... + 55005005555.
It is an arithmetic number, because the mean of its divisors is an integer number (165015016653).
Almost surely, 2550050055505 is an apocalyptic number.
It is an amenable number.
550050055505 is a deficient number, since it is larger than the sum of its proper divisors (110010011107).
550050055505 is a wasteful number, since it uses less digits than its factorization.
550050055505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110010011106.
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 550050055505 in words is "five hundred fifty billion, fifty million, fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •