Base | Representation |
---|---|
bin | 1001011111110011110000… |
… | …0001111101100001111101 |
3 | 1100222020210222220100222111 |
4 | 2113330330001331201331 |
5 | 2332040331044044314 |
6 | 34113004424014021 |
7 | 2125262202665200 |
oct | 227747401754175 |
9 | 40866728810874 |
10 | 10442072643709 |
11 | 3366504868343 |
12 | 12078b1001311 |
13 | 5a98b60793c5 |
14 | 281582c67937 |
15 | 131950284ec4 |
hex | 97f3c07d87d |
10442072643709 has 12 divisors (see below), whose sum is σ = 12861424409724. Its totient is φ = 8423856921984.
The previous prime is 10442072643697. The next prime is 10442072643731. The reversal of 10442072643709 is 90734627024401.
It can be written as a sum of positive squares in 2 ways, for example, as 8481170940025 + 1960901703684 = 2912245^2 + 1400322^2 .
It is not a de Polignac number, because 10442072643709 - 225 = 10442039089277 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10442072643109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6267749854 + ... + 6267751519.
It is an arithmetic number, because the mean of its divisors is an integer number (1071785367477).
Almost surely, 210442072643709 is an apocalyptic number.
It is an amenable number.
10442072643709 is a deficient number, since it is larger than the sum of its proper divisors (2419351766015).
10442072643709 is a wasteful number, since it uses less digits than its factorization.
10442072643709 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12535501404 (or 12535501397 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 49.
The spelling of 10442072643709 in words is "ten trillion, four hundred forty-two billion, seventy-two million, six hundred forty-three thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •