Base | Representation |
---|---|
bin | 100100011000010101000… |
… | …1101010000111010010001 |
3 | 122201000000002022001212212 |
4 | 1020300222031100322101 |
5 | 1123410100303142003 |
6 | 14344554041201505 |
7 | 1024145621126420 |
oct | 110605215207221 |
9 | 18630002261785 |
10 | 5000050052753 |
11 | 16585669a3978 |
12 | 689062790295 |
13 | 2a366c56a692 |
14 | 13400a2952b7 |
15 | 8a0e1d0bdd8 |
hex | 48c2a350e91 |
5000050052753 has 4 divisors (see below), whose sum is σ = 5714342917440. Its totient is φ = 4285757188068.
The previous prime is 5000050052743. The next prime is 5000050052791. The reversal of 5000050052753 is 3572500500005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5000050052753 - 24 = 5000050052737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5000050052743) 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, 357146432333 + ... + 357146432346.
It is an arithmetic number, because the mean of its divisors is an integer number (1428585729360).
Almost surely, 25000050052753 is an apocalyptic number.
It is an amenable number.
5000050052753 is a deficient number, since it is larger than the sum of its proper divisors (714292864687).
5000050052753 is an equidigital number, since it uses as much as digits as its factorization.
5000050052753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714292864686.
The product of its (nonzero) digits is 26250, while the sum is 32.
Adding to 5000050052753 its reverse (3572500500005), we get a palindrome (8572550552758).
The spelling of 5000050052753 in words is "five trillion, fifty million, fifty-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •