Base | Representation |
---|---|
bin | 1111010110011010… |
… | …11110101011000001 |
3 | 210021100011121210102 |
4 | 13223031132223001 |
5 | 113334213142221 |
6 | 3441432212145 |
7 | 411136406234 |
oct | 75315365301 |
9 | 23240147712 |
10 | 8241146561 |
11 | 3549a0442a |
12 | 171bb3a055 |
13 | a144a5aab |
14 | 58271b41b |
15 | 33378130b |
hex | 1eb35eac1 |
8241146561 has 4 divisors (see below), whose sum is σ = 8290494912. Its totient is φ = 8191798212.
The previous prime is 8241146539. The next prime is 8241146591. The reversal of 8241146561 is 1656411428.
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 a de Polignac number, because none of the positive numbers 2k-8241146561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8241146531) 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 3 ways as a sum of consecutive naturals, for example, 24673925 + ... + 24674258.
It is an arithmetic number, because the mean of its divisors is an integer number (2072623728).
Almost surely, 28241146561 is an apocalyptic number.
It is an amenable number.
8241146561 is a deficient number, since it is larger than the sum of its proper divisors (49348351).
8241146561 is a wasteful number, since it uses less digits than its factorization.
8241146561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49348350.
The product of its digits is 46080, while the sum is 38.
The square root of 8241146561 is about 90780.7609628824. The cubic root of 8241146561 is about 2019.8969461036.
Adding to 8241146561 its reverse (1656411428), we get a palindrome (9897557989).
The spelling of 8241146561 in words is "eight billion, two hundred forty-one million, one hundred forty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •