Base | Representation |
---|---|
bin | 1110101000111111010… |
… | …11010110000111110011 |
3 | 1210002102220110100010101 |
4 | 13110133223112013303 |
5 | 31220212403131011 |
6 | 1023032233213231 |
7 | 51225602543206 |
oct | 7243753260763 |
9 | 1702386410111 |
10 | 503042630131 |
11 | 1843804a5558 |
12 | 815abb61217 |
13 | 3858a60a032 |
14 | 1a4c136593d |
15 | d142ce82c1 |
hex | 751fad61f3 |
503042630131 has 8 divisors (see below), whose sum is σ = 514867668480. Its totient is φ = 491223336072.
The previous prime is 503042630093. The next prime is 503042630137. The reversal of 503042630131 is 131036240305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-503042630131 is a prime.
It is a super-2 number, since 2×5030426301312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 503042630131.
It is not an unprimeable number, because it can be changed into a prime (503042630137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1258615 + ... + 1609408.
It is an arithmetic number, because the mean of its divisors is an integer number (64358458560).
Almost surely, 2503042630131 is an apocalyptic number.
503042630131 is a deficient number, since it is larger than the sum of its proper divisors (11825038349).
503042630131 is a wasteful number, since it uses less digits than its factorization.
503042630131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2872145.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 503042630131 its reverse (131036240305), we get a palindrome (634078870436).
The spelling of 503042630131 in words is "five hundred three billion, forty-two million, six hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •