Base | Representation |
---|---|
bin | 10100000000100011… |
… | …11000011110110101 |
3 | 1000201122011112020011 |
4 | 22000101320132311 |
5 | 133444434343122 |
6 | 4533532340221 |
7 | 530125252255 |
oct | 120021703665 |
9 | 30648145204 |
10 | 10742106037 |
11 | 4612703293 |
12 | 20b9614671 |
13 | 102267cb80 |
14 | 73c93b965 |
15 | 42d0eb377 |
hex | 2804787b5 |
10742106037 has 4 divisors (see below), whose sum is σ = 11568421900. Its totient is φ = 9915790176.
The previous prime is 10742105999. The next prime is 10742106043. The reversal of 10742106037 is 73060124701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73060124701 = 41 ⋅1781954261.
It can be written as a sum of positive squares in 2 ways, for example, as 6822594801 + 3919511236 = 82599^2 + 62606^2 .
It is a cyclic number.
It is not a de Polignac number, because 10742106037 - 211 = 10742103989 is a prime.
It is a super-2 number, since 2×107421060372 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10742106077) 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, 413157912 + ... + 413157937.
It is an arithmetic number, because the mean of its divisors is an integer number (2892105475).
Almost surely, 210742106037 is an apocalyptic number.
It is an amenable number.
10742106037 is a deficient number, since it is larger than the sum of its proper divisors (826315863).
10742106037 is an equidigital number, since it uses as much as digits as its factorization.
10742106037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826315862.
The product of its (nonzero) digits is 7056, while the sum is 31.
The spelling of 10742106037 in words is "ten billion, seven hundred forty-two million, one hundred six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •