Base | Representation |
---|---|
bin | 11101010011101100100… |
… | …10000110100101110101 |
3 | 10120021021000221222001221 |
4 | 32221312102012211311 |
5 | 112444322220214331 |
6 | 2050340150350341 |
7 | 132516365415016 |
oct | 16516622064565 |
9 | 3507230858057 |
10 | 1007006804341 |
11 | 3590840a778a |
12 | 1431b865b3b1 |
13 | 73c63b14905 |
14 | 36a4cc5500d |
15 | 1b2db976711 |
hex | ea76486975 |
1007006804341 has 4 divisors (see below), whose sum is σ = 1066242498732. Its totient is φ = 947771109952.
The previous prime is 1007006804339. The next prime is 1007006804369. The reversal of 1007006804341 is 1434086007001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 882453572100 + 124553232241 = 939390^2 + 352921^2 .
It is a cyclic number.
It is not a de Polignac number, because 1007006804341 - 21 = 1007006804339 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1007006804297 and 1007006804306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1007006804371) 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, 29617847170 + ... + 29617847203.
It is an arithmetic number, because the mean of its divisors is an integer number (266560624683).
Almost surely, 21007006804341 is an apocalyptic number.
It is an amenable number.
1007006804341 is a deficient number, since it is larger than the sum of its proper divisors (59235694391).
1007006804341 is an equidigital number, since it uses as much as digits as its factorization.
1007006804341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59235694390.
The product of its (nonzero) digits is 16128, while the sum is 34.
The spelling of 1007006804341 in words is "one trillion, seven billion, six million, eight hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •