Base | Representation |
---|---|
bin | 1111000010001001… |
… | …10110100101010001 |
3 | 202211111020000122122 |
4 | 13201010312211101 |
5 | 113012201104131 |
6 | 3412515544025 |
7 | 404003220545 |
oct | 74104664521 |
9 | 22744200578 |
10 | 8071113041 |
11 | 3471a29762 |
12 | 1692bbb015 |
13 | 9b81b1444 |
14 | 567cd9a25 |
15 | 323895d7b |
hex | 1e1136951 |
8071113041 has 4 divisors (see below), whose sum is σ = 8146544112. Its totient is φ = 7995681972.
The previous prime is 8071113019. The next prime is 8071113059. The reversal of 8071113041 is 1403111708.
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 8071113041 - 26 = 8071112977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 8071113041.
It is not an unprimeable number, because it can be changed into a prime (8071103041) 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, 37715375 + ... + 37715588.
It is an arithmetic number, because the mean of its divisors is an integer number (2036636028).
Almost surely, 28071113041 is an apocalyptic number.
It is an amenable number.
8071113041 is a deficient number, since it is larger than the sum of its proper divisors (75431071).
8071113041 is a wasteful number, since it uses less digits than its factorization.
8071113041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75431070.
The product of its (nonzero) digits is 672, while the sum is 26.
The square root of 8071113041 is about 89839.3735563645. The cubic root of 8071113041 is about 2005.9086137021.
Adding to 8071113041 its reverse (1403111708), we get a palindrome (9474224749).
The spelling of 8071113041 in words is "eight billion, seventy-one million, one hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •