Base | Representation |
---|---|
bin | 1110100100010000111… |
… | …01011000011101000111 |
3 | 1202211220002121100211212 |
4 | 13102020131120131013 |
5 | 31200013414010210 |
6 | 1021532404122035 |
7 | 51105665330213 |
oct | 7221035303507 |
9 | 1684802540755 |
10 | 500505610055 |
11 | 183299406850 |
12 | 8100239631b |
13 | 38274b18519 |
14 | 1a320439943 |
15 | d045208805 |
hex | 7488758747 |
500505610055 has 16 divisors (see below), whose sum is σ = 655230963744. Its totient is φ = 363990958080.
The previous prime is 500505609997. The next prime is 500505610057. The reversal of 500505610055 is 550016505005.
It is not a de Polignac number, because 500505610055 - 212 = 500505605959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500505610057) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1533887 + ... + 1831343.
It is an arithmetic number, because the mean of its divisors is an integer number (40951935234).
Almost surely, 2500505610055 is an apocalyptic number.
500505610055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
500505610055 is a deficient number, since it is larger than the sum of its proper divisors (154725353689).
500505610055 is a wasteful number, since it uses less digits than its factorization.
500505610055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328066.
The product of its (nonzero) digits is 18750, while the sum is 32.
The spelling of 500505610055 in words is "five hundred billion, five hundred five million, six hundred ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •