Base | Representation |
---|---|
bin | 101000011000011100100… |
… | …0101101110110001100010 |
3 | 201122120122220200020121211 |
4 | 1100300321011232301202 |
5 | 1211413003210100200 |
6 | 15445354343540334 |
7 | 1111656356535664 |
oct | 120607105566142 |
9 | 21576586606554 |
10 | 5550055550050 |
11 | 184a846739640 |
12 | 75777a45a6aa |
13 | 3134a26313bb |
14 | 1528a483a534 |
15 | 99582a1daba |
hex | 50c3916ec62 |
5550055550050 has 96 divisors (see below), whose sum is σ = 11375343770688. Its totient is φ = 1997820000000.
The previous prime is 5550055550021. The next prime is 5550055550063. The reversal of 5550055550050 is 500555500555.
It is a junction number, because it is equal to n+sod(n) for n = 5550055549985 and 5550055550012.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 549995505 + ... + 550005595.
It is an arithmetic number, because the mean of its divisors is an integer number (118493164278).
Almost surely, 25550055550050 is an apocalyptic number.
5550055550050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5550055550050 is an abundant number, since it is smaller than the sum of its proper divisors (5825288220638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5550055550050 is a wasteful number, since it uses less digits than its factorization.
5550055550050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20116 (or 20111 counting only the distinct ones).
The product of its (nonzero) digits is 390625, while the sum is 40.
It can be divided in two parts, 5 and 550055550050, that added together give a palindrome (550055550055).
The spelling of 5550055550050 in words is "five trillion, five hundred fifty billion, fifty-five million, five hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •