Base | Representation |
---|---|
bin | 100100100010110010001… |
… | …1110100111000111111001 |
3 | 122210010221211120100010211 |
4 | 1021011210132213013321 |
5 | 1124242041120441233 |
6 | 14403150015311121 |
7 | 1025602202661532 |
oct | 111054436470771 |
9 | 18703854510124 |
10 | 5022502515193 |
11 | 1667038808259 |
12 | 691489b1b4a1 |
13 | 2a580a06c107 |
14 | 13513a175689 |
15 | 8a9a80135cd |
hex | 491647a71f9 |
5022502515193 has 2 divisors, whose sum is σ = 5022502515194. Its totient is φ = 5022502515192.
The previous prime is 5022502515181. The next prime is 5022502515209. The reversal of 5022502515193 is 3915152052205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5022493352464 + 9162729 = 2241092^2 + 3027^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5022502515193 is a prime.
It is a super-3 number, since 3×50225025151933 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (5022502515893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2511251257596 + 2511251257597.
It is an arithmetic number, because the mean of its divisors is an integer number (2511251257597).
Almost surely, 25022502515193 is an apocalyptic number.
It is an amenable number.
5022502515193 is a deficient number, since it is larger than the sum of its proper divisors (1).
5022502515193 is an equidigital number, since it uses as much as digits as its factorization.
5022502515193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135000, while the sum is 40.
Adding to 5022502515193 its reverse (3915152052205), we get a palindrome (8937654567398).
The spelling of 5022502515193 in words is "five trillion, twenty-two billion, five hundred two million, five hundred fifteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •