Base | Representation |
---|---|
bin | 1110100111010100100… |
… | …11110100100110000001 |
3 | 1210000010111200101100121 |
4 | 13103222103310212001 |
5 | 31211344200133131 |
6 | 1022403330420241 |
7 | 51164451243643 |
oct | 7235223644601 |
9 | 1700114611317 |
10 | 502147271041 |
11 | 183a61052a69 |
12 | 813a0131681 |
13 | 38476c79b60 |
14 | 1a438496893 |
15 | d0de3d6911 |
hex | 74ea4f4981 |
502147271041 has 16 divisors (see below), whose sum is σ = 575631705600. Its totient is φ = 434190734208.
The previous prime is 502147271029. The next prime is 502147271053. The reversal of 502147271041 is 140172741205.
It is an interprime number because it is at equal distance from previous prime (502147271029) and next prime (502147271053).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-502147271041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 502147270988 and 502147271006.
It is not an unprimeable number, because it can be changed into a prime (502147271071) 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 15 ways as a sum of consecutive naturals, for example, 11399281 + ... + 11443246.
It is an arithmetic number, because the mean of its divisors is an integer number (35976981600).
Almost surely, 2502147271041 is an apocalyptic number.
It is an amenable number.
502147271041 is a deficient number, since it is larger than the sum of its proper divisors (73484434559).
502147271041 is a wasteful number, since it uses less digits than its factorization.
502147271041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22842648.
The product of its (nonzero) digits is 15680, while the sum is 34.
The spelling of 502147271041 in words is "five hundred two billion, one hundred forty-seven million, two hundred seventy-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •