Base | Representation |
---|---|
bin | 101110100100100011… |
… | …110110000001100101 |
3 | 11210001222011121012202 |
4 | 232210203312001211 |
5 | 1304402402000010 |
6 | 34545555224245 |
7 | 3420116510516 |
oct | 564443660145 |
9 | 153058147182 |
10 | 50005500005 |
11 | 1a23088a30a |
12 | 98368a8085 |
13 | 493bc47276 |
14 | 25c5362a0d |
15 | 147a0ce6a5 |
hex | ba48f6065 |
50005500005 has 4 divisors (see below), whose sum is σ = 60006600012. Its totient is φ = 40004400000.
The previous prime is 50005499993. The next prime is 50005500029. The reversal of 50005500005 is 50000550005.
It is a happy number.
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 25856961601 + 24148538404 = 160801^2 + 155398^2 .
It is not a de Polignac number, because 50005500005 - 216 = 50005434469 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50005500005.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5000549996 + ... + 5000550005.
It is an arithmetic number, because the mean of its divisors is an integer number (15001650003).
Almost surely, 250005500005 is an apocalyptic number.
It is an amenable number.
50005500005 is a deficient number, since it is larger than the sum of its proper divisors (10001100007).
50005500005 is a wasteful number, since it uses less digits than its factorization.
50005500005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001100006.
The product of its (nonzero) digits is 625, while the sum is 20.
It can be divided in two parts, 5000550000 and 5, that added together give a palindrome (5000550005).
The spelling of 50005500005 in words is "fifty billion, five million, five hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •