Base | Representation |
---|---|
bin | 1110100100010000110… |
… | …11001111101110000111 |
3 | 1202211220001112220120202 |
4 | 13102020123033232013 |
5 | 31200013243044431 |
6 | 1021532344121115 |
7 | 51105660505322 |
oct | 7221033175607 |
9 | 1684801486522 |
10 | 500505049991 |
11 | 183299063a91 |
12 | 8100216619b |
13 | 3827498061b |
14 | 1a3203317b9 |
15 | d0451478cb |
hex | 74886cfb87 |
500505049991 has 4 divisors (see below), whose sum is σ = 500518263672. Its totient is φ = 500491836312.
The previous prime is 500505049987. The next prime is 500505050011. The reversal of 500505049991 is 199940505005.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 500505049991 - 22 = 500505049987 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 (500505049091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6549860 + ... + 6625833.
It is an arithmetic number, because the mean of its divisors is an integer number (125129565918).
Almost surely, 2500505049991 is an apocalyptic number.
500505049991 is a deficient number, since it is larger than the sum of its proper divisors (13213681).
500505049991 is a wasteful number, since it uses less digits than its factorization.
500505049991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13213680.
The product of its (nonzero) digits is 364500, while the sum is 47.
The spelling of 500505049991 in words is "five hundred billion, five hundred five million, forty-nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •