Base | Representation |
---|---|
bin | 1110100100010110110… |
… | …11101101110110011010 |
3 | 1202212000120111021220122 |
4 | 13102023123231312122 |
5 | 31200114202130200 |
6 | 1021541345353242 |
7 | 51110142406526 |
oct | 7221333556632 |
9 | 1685016437818 |
10 | 500555505050 |
11 | 183314595687 |
12 | 81017038822 |
13 | 38282267ba3 |
14 | 1a326d06d86 |
15 | d0497b2385 |
hex | 748b6edd9a |
500555505050 has 12 divisors (see below), whose sum is σ = 931033239486. Its totient is φ = 200222202000.
The previous prime is 500555504993. The next prime is 500555505101. The reversal of 500555505050 is 50505555005.
It can be written as a sum of positive squares in 3 ways, for example, as 205362142561 + 295193362489 = 453169^2 + 543317^2 .
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 500555505050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5005555001 + ... + 5005555100.
Almost surely, 2500555505050 is an apocalyptic number.
500555505050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
500555505050 is a deficient number, since it is larger than the sum of its proper divisors (430477734436).
500555505050 is a wasteful number, since it uses less digits than its factorization.
500555505050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10011110113 (or 10011110108 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 500555505050 in words is "five hundred billion, five hundred fifty-five million, five hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •