Base | Representation |
---|---|
bin | 100101001000000011010… |
… | …0111101101010100101001 |
3 | 200001210112020120120202021 |
4 | 1022100012213231110221 |
5 | 1132044441222021301 |
6 | 14504023153504441 |
7 | 1034434335152623 |
oct | 112200647552451 |
9 | 20053466516667 |
10 | 5102532220201 |
11 | 1697a76463129 |
12 | 6a4aa3872121 |
13 | 2b02223a4850 |
14 | 138d6cc43c13 |
15 | 8caddded8a1 |
hex | 4a4069ed529 |
5102532220201 has 8 divisors (see below), whose sum is σ = 5784247051520. Its totient is φ = 4462133439312.
The previous prime is 5102532220169. The next prime is 5102532220213. The reversal of 5102532220201 is 1020222352015.
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 5102532220201 - 25 = 5102532220169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5102532220271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10329012345 + ... + 10329012838.
It is an arithmetic number, because the mean of its divisors is an integer number (723030881440).
Almost surely, 25102532220201 is an apocalyptic number.
It is an amenable number.
5102532220201 is a deficient number, since it is larger than the sum of its proper divisors (681714831319).
5102532220201 is a wasteful number, since it uses less digits than its factorization.
5102532220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20658025215.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 5102532220201 its reverse (1020222352015), we get a palindrome (6122754572216).
The spelling of 5102532220201 in words is "five trillion, one hundred two billion, five hundred thirty-two million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •