Base | Representation |
---|---|
bin | 100101111011000001110… |
… | …0011101101001101100101 |
3 | 200110021002102020021021001 |
4 | 1023312003203231031211 |
5 | 1140343140120134243 |
6 | 15030205541553301 |
7 | 1045361165216563 |
oct | 113660343551545 |
9 | 20407072207231 |
10 | 5212002505573 |
11 | 172a4415a0856 |
12 | 702155115831 |
13 | 2ba649c14536 |
14 | 140395938a33 |
15 | 9089975da4d |
hex | 4bd838ed365 |
5212002505573 has 8 divisors (see below), whose sum is σ = 5380319421440. Its totient is φ = 5043697327440.
The previous prime is 5212002505561. The next prime is 5212002505583. The reversal of 5212002505573 is 3755052002125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5212002505573 - 213 = 5212002497381 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 (5212002505553) 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 7 ways as a sum of consecutive naturals, for example, 2027565 + ... + 3812482.
It is an arithmetic number, because the mean of its divisors is an integer number (672539927680).
Almost surely, 25212002505573 is an apocalyptic number.
It is an amenable number.
5212002505573 is a deficient number, since it is larger than the sum of its proper divisors (168316915867).
5212002505573 is a wasteful number, since it uses less digits than its factorization.
5212002505573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5868867.
The product of its (nonzero) digits is 105000, while the sum is 37.
Adding to 5212002505573 its reverse (3755052002125), we get a palindrome (8967054507698).
The spelling of 5212002505573 in words is "five trillion, two hundred twelve billion, two million, five hundred five thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •