Base | Representation |
---|---|
bin | 1110101000000010100… |
… | …11011101001100000101 |
3 | 1210001010101121001011110 |
4 | 13110001103131030011 |
5 | 31213141430114031 |
6 | 1022505511155233 |
7 | 51210144312162 |
oct | 7240123351405 |
9 | 1701111531143 |
10 | 502533051141 |
11 | 1841398962a0 |
12 | 81489375b19 |
13 | 38508b7cbc4 |
14 | 1a4737d9069 |
15 | d1131dbc46 |
hex | 75014dd305 |
502533051141 has 16 divisors (see below), whose sum is σ = 730972791360. Its totient is φ = 304558974720.
The previous prime is 502533051113. The next prime is 502533051143. The reversal of 502533051141 is 141150335205.
It is not a de Polignac number, because 502533051141 - 26 = 502533051077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 502533051099 and 502533051108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (502533051143) 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 15 ways as a sum of consecutive naturals, for example, 1734301 + ... + 2003213.
It is an arithmetic number, because the mean of its divisors is an integer number (45685799460).
Almost surely, 2502533051141 is an apocalyptic number.
It is an amenable number.
502533051141 is a deficient number, since it is larger than the sum of its proper divisors (228439740219).
502533051141 is a wasteful number, since it uses less digits than its factorization.
502533051141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325556.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 502533051141 its reverse (141150335205), we get a palindrome (643683386346).
The spelling of 502533051141 in words is "five hundred two billion, five hundred thirty-three million, fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •