Base | Representation |
---|---|
bin | 111101101101110000011… |
… | …0010011111110001101001 |
3 | 1010000212121201121210022202 |
4 | 1323123200302133301221 |
5 | 2102432202403313131 |
6 | 30012332141025545 |
7 | 1533543531003353 |
oct | 173334062376151 |
9 | 33025551553282 |
10 | 8482036776041 |
11 | 27802366a76a4 |
12 | b4ba60b552b5 |
13 | 496b1131991a |
14 | 214765cca0d3 |
15 | ea985a56bcb |
hex | 7b6e0c9fc69 |
8482036776041 has 4 divisors (see below), whose sum is σ = 8482956047952. Its totient is φ = 8481117504132.
The previous prime is 8482036776029. The next prime is 8482036776091. The reversal of 8482036776041 is 1406776302848.
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 8482036776041 - 238 = 8207158869097 is a prime.
It is a super-3 number, since 3×84820367760413 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8482036776091) 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, 459622115 + ... + 459640568.
It is an arithmetic number, because the mean of its divisors is an integer number (2120739011988).
Almost surely, 28482036776041 is an apocalyptic number.
It is an amenable number.
8482036776041 is a deficient number, since it is larger than the sum of its proper divisors (919271911).
8482036776041 is an equidigital number, since it uses as much as digits as its factorization.
8482036776041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919271910.
The product of its (nonzero) digits is 10838016, while the sum is 56.
The spelling of 8482036776041 in words is "eight trillion, four hundred eighty-two billion, thirty-six million, seven hundred seventy-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •