Base | Representation |
---|---|
bin | 1110101011000010010… |
… | …10011100100101010101 |
3 | 1210012021110210122201211 |
4 | 13111201022130211111 |
5 | 31224440133131401 |
6 | 1023333241421421 |
7 | 51265043235403 |
oct | 7254112344525 |
9 | 1705243718654 |
10 | 504141302101 |
11 | 184894693018 |
12 | 81857a9a871 |
13 | 387041143a8 |
14 | 1a58723a473 |
15 | d1a94ba951 |
hex | 756129c955 |
504141302101 has 8 divisors (see below), whose sum is σ = 515163527424. Its totient is φ = 493131402480.
The previous prime is 504141302047. The next prime is 504141302113. The reversal of 504141302101 is 101203141405.
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 504141302101 - 219 = 504140777813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (504141302701) 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 7 ways as a sum of consecutive naturals, for example, 2998705 + ... + 3162358.
It is an arithmetic number, because the mean of its divisors is an integer number (64395440928).
Almost surely, 2504141302101 is an apocalyptic number.
It is an amenable number.
504141302101 is a deficient number, since it is larger than the sum of its proper divisors (11022225323).
504141302101 is a wasteful number, since it uses less digits than its factorization.
504141302101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6162851.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 504141302101 its reverse (101203141405), we get a palindrome (605344443506).
The spelling of 504141302101 in words is "five hundred four billion, one hundred forty-one million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •