Base | Representation |
---|---|
bin | 1110100011011011001… |
… | …10101000011100111111 |
3 | 1202210201200210112201011 |
4 | 13101231212220130333 |
5 | 31143103043100142 |
6 | 1021415551100051 |
7 | 51061554536200 |
oct | 7215546503477 |
9 | 1683650715634 |
10 | 500055050047 |
11 | 183088048403 |
12 | 80ab7511627 |
13 | 38202683977 |
14 | 1a2ba6735a7 |
15 | d01a8a9417 |
hex | 746d9a873f |
500055050047 has 12 divisors (see below), whose sum is σ = 582655039680. Its totient is φ = 427912462656.
The previous prime is 500055050009. The next prime is 500055050051. The reversal of 500055050047 is 740050550005.
It is not a de Polignac number, because 500055050047 - 27 = 500055049919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500055050947) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 8376522 + ... + 8436007.
It is an arithmetic number, because the mean of its divisors is an integer number (48554586640).
Almost surely, 2500055050047 is an apocalyptic number.
500055050047 is a deficient number, since it is larger than the sum of its proper divisors (82599989633).
500055050047 is a wasteful number, since it uses less digits than its factorization.
500055050047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16813150 (or 16813143 counting only the distinct ones).
The product of its (nonzero) digits is 17500, while the sum is 31.
The spelling of 500055050047 in words is "five hundred billion, fifty-five million, fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •