Base | Representation |
---|---|
bin | 111010011101001010011… |
… | …0000101011011100010101 |
3 | 1001110001101011122010102201 |
4 | 1310322110300223130111 |
5 | 2023112301131213331 |
6 | 25030450232004501 |
7 | 1456305051420205 |
oct | 164722460533425 |
9 | 31401334563381 |
10 | 8034084632341 |
11 | 2618266365a79 |
12 | a99086830731 |
13 | 4637c32a0671 |
14 | 1dabcd38c405 |
15 | ddeb9480a61 |
hex | 74e94c2b715 |
8034084632341 has 8 divisors (see below), whose sum is σ = 8185894776864. Its totient is φ = 7882282770960.
The previous prime is 8034084632239. The next prime is 8034084632401. The reversal of 8034084632341 is 1432364804308.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 8034084632341 - 27 = 8034084632213 is a prime.
It is a super-2 number, since 2×80340846323412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8034084632291 and 8034084632300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8034084635341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94951 + ... + 4009636.
It is an arithmetic number, because the mean of its divisors is an integer number (1023236847108).
Almost surely, 28034084632341 is an apocalyptic number.
It is an amenable number.
8034084632341 is a deficient number, since it is larger than the sum of its proper divisors (151810144523).
8034084632341 is a wasteful number, since it uses less digits than its factorization.
8034084632341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4141571.
The product of its (nonzero) digits is 1327104, while the sum is 46.
The spelling of 8034084632341 in words is "eight trillion, thirty-four billion, eighty-four million, six hundred thirty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •