Base | Representation |
---|---|
bin | 1111001010100000… |
… | …11111111110100001 |
3 | 210000101020121211020 |
4 | 13211100133332201 |
5 | 113133131300131 |
6 | 3423503440053 |
7 | 405514460514 |
oct | 74520377641 |
9 | 23011217736 |
10 | 8141275041 |
11 | 34a85a0489 |
12 | 16b25b6029 |
13 | 9c98a8913 |
14 | 573360d7b |
15 | 329b04996 |
hex | 1e541ffa1 |
8141275041 has 8 divisors (see below), whose sum is σ = 10897271904. Its totient is φ = 5406397440.
The previous prime is 8141275031. The next prime is 8141275091. The reversal of 8141275041 is 1405721418.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 8141275041 - 210 = 8141274017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 8141274993 and 8141275011.
It is not an unprimeable number, because it can be changed into a prime (8141275001) 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, 5278915 + ... + 5280456.
It is an arithmetic number, because the mean of its divisors is an integer number (1362158988).
Almost surely, 28141275041 is an apocalyptic number.
It is an amenable number.
8141275041 is a deficient number, since it is larger than the sum of its proper divisors (2755996863).
8141275041 is a wasteful number, since it uses less digits than its factorization.
8141275041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10559631.
The product of its (nonzero) digits is 8960, while the sum is 33.
The square root of 8141275041 is about 90229.0144077835. The cubic root of 8141275041 is about 2011.7042912518.
Adding to 8141275041 its reverse (1405721418), we get a palindrome (9546996459).
The spelling of 8141275041 in words is "eight billion, one hundred forty-one million, two hundred seventy-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •