Base | Representation |
---|---|
bin | 1110100101110100111… |
… | …11100011110001101001 |
3 | 1202221001121010220022212 |
4 | 13102322133203301221 |
5 | 31203223312312023 |
6 | 1022151552054505 |
7 | 51135540353231 |
oct | 7227237436151 |
9 | 1687047126285 |
10 | 501345041513 |
11 | 18368a22a058 |
12 | 811b7534435 |
13 | 383799c6224 |
14 | 1a39db0acc1 |
15 | d093c6de78 |
hex | 74ba7e3c69 |
501345041513 has 8 divisors (see below), whose sum is σ = 506282153856. Its totient is φ = 496430629200.
The previous prime is 501345041503. The next prime is 501345041531. The reversal of 501345041513 is 315140543105.
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 501345041513 - 24 = 501345041497 is a prime.
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 501345041513.
It is not an unprimeable number, because it can be changed into a prime (501345041503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5630618 + ... + 5718963.
It is an arithmetic number, because the mean of its divisors is an integer number (63285269232).
Almost surely, 2501345041513 is an apocalyptic number.
It is an amenable number.
501345041513 is a deficient number, since it is larger than the sum of its proper divisors (4937112343).
501345041513 is a wasteful number, since it uses less digits than its factorization.
501345041513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11350015.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 501345041513 its reverse (315140543105), we get a palindrome (816485584618).
The spelling of 501345041513 in words is "five hundred one billion, three hundred forty-five million, forty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •