Base | Representation |
---|---|
bin | 100100101111100101111… |
… | …0010001100011000001110 |
3 | 122212202221120022000020022 |
4 | 1021133023302030120032 |
5 | 1130214402402134200 |
6 | 14423535052022142 |
7 | 1030564562355065 |
oct | 111371362143016 |
9 | 18782846260208 |
10 | 5050005505550 |
11 | 16777714aaa55 |
12 | 696884761952 |
13 | 2a82a1010bc5 |
14 | 1365c8b0b1dc |
15 | 8b567802885 |
hex | 497cbc8c60e |
5050005505550 has 96 divisors (see below), whose sum is σ = 10103008366080. Its totient is φ = 1871994067200.
The previous prime is 5050005505529. The next prime is 5050005505621. The reversal of 5050005505550 is 555055000505.
It is a super-2 number, since 2×50500055055502 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5050005505550.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 88691090 + ... + 88748010.
It is an arithmetic number, because the mean of its divisors is an integer number (105239670480).
Almost surely, 25050005505550 is an apocalyptic number.
5050005505550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5050005505550 is an abundant number, since it is smaller than the sum of its proper divisors (5053002860530).
5050005505550 is a wasteful number, since it uses less digits than its factorization.
5050005505550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58986 (or 58981 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 35.
It can be divided in two parts, 5050005 and 505550, that added together give a palindrome (5555555).
The spelling of 5050005505550 in words is "five trillion, fifty billion, five million, five hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •