Base | Representation |
---|---|
bin | 1110100110000000111… |
… | …01010011000101100001 |
3 | 1202221022120110000110011 |
4 | 13103000131103011201 |
5 | 31203424422042121 |
6 | 1022205525004521 |
7 | 51141164061340 |
oct | 7230035230541 |
9 | 1687276400404 |
10 | 501445112161 |
11 | 183730769674 |
12 | 81224b53741 |
13 | 38394662c26 |
14 | 1a3ad119b57 |
15 | d09c9397e1 |
hex | 74c0753161 |
501445112161 has 4 divisors (see below), whose sum is σ = 573080128192. Its totient is φ = 429810096132.
The previous prime is 501445112159. The next prime is 501445112197. The reversal of 501445112161 is 161211544105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 501445112161 - 21 = 501445112159 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (501445112561) 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 3 ways as a sum of consecutive naturals, for example, 35817508005 + ... + 35817508018.
It is an arithmetic number, because the mean of its divisors is an integer number (143270032048).
Almost surely, 2501445112161 is an apocalyptic number.
It is an amenable number.
501445112161 is a deficient number, since it is larger than the sum of its proper divisors (71635016031).
501445112161 is an equidigital number, since it uses as much as digits as its factorization.
501445112161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71635016030.
The product of its (nonzero) digits is 4800, while the sum is 31.
Adding to 501445112161 its reverse (161211544105), we get a palindrome (662656656266).
The spelling of 501445112161 in words is "five hundred one billion, four hundred forty-five million, one hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •