Base | Representation |
---|---|
bin | 1110100101111111011… |
… | …11100110010001101101 |
3 | 1202221021201220100221201 |
4 | 13102333233212101231 |
5 | 31203413340212031 |
6 | 1022204420125501 |
7 | 51140660204224 |
oct | 7227757462155 |
9 | 1687251810851 |
10 | 501433132141 |
11 | 183724a26927 |
12 | 81220b36891 |
13 | 3839202a066 |
14 | 1a3ab6bbcbb |
15 | d09b86ed61 |
hex | 74bfbe646d |
501433132141 has 4 divisors (see below), whose sum is σ = 509653347484. Its totient is φ = 493212916800.
The previous prime is 501433132127. The next prime is 501433132159. The reversal of 501433132141 is 141231334105.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 183658530916 + 317774601225 = 428554^2 + 563715^2 .
It is a cyclic number.
It is not a de Polignac number, because 501433132141 - 233 = 492843197549 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 (501433132171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4110107580 + ... + 4110107701.
It is an arithmetic number, because the mean of its divisors is an integer number (127413336871).
Almost surely, 2501433132141 is an apocalyptic number.
It is an amenable number.
501433132141 is a deficient number, since it is larger than the sum of its proper divisors (8220215343).
501433132141 is an equidigital number, since it uses as much as digits as its factorization.
501433132141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8220215342.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 501433132141 its reverse (141231334105), we get a palindrome (642664466246).
The spelling of 501433132141 in words is "five hundred one billion, four hundred thirty-three million, one hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •