Base | Representation |
---|---|
bin | 100100110000100100111… |
… | …1010001100000010000111 |
3 | 122212222102000222012202212 |
4 | 1021201021322030002013 |
5 | 1130233221102434003 |
6 | 14424525041454035 |
7 | 1031001165314045 |
oct | 111411172140207 |
9 | 18788360865685 |
10 | 5052121530503 |
11 | 1678657993903 |
12 | 69717534131b |
13 | 2a854a51ca88 |
14 | 136749b69395 |
15 | 8b63d482dd8 |
hex | 49849e8c087 |
5052121530503 has 4 divisors (see below), whose sum is σ = 5059584044520. Its totient is φ = 5044659016488.
The previous prime is 5052121530431. The next prime is 5052121530517. The reversal of 5052121530503 is 3050351212505.
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 5052121530503 - 230 = 5051047788679 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 5052121530503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5052121530563) by changing a digit.
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, 3731255993 + ... + 3731257346.
It is an arithmetic number, because the mean of its divisors is an integer number (1264896011130).
Almost surely, 25052121530503 is an apocalyptic number.
5052121530503 is a deficient number, since it is larger than the sum of its proper divisors (7462514017).
5052121530503 is an equidigital number, since it uses as much as digits as its factorization.
5052121530503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7462514016.
The product of its (nonzero) digits is 22500, while the sum is 32.
The spelling of 5052121530503 in words is "five trillion, fifty-two billion, one hundred twenty-one million, five hundred thirty thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •