Base | Representation |
---|---|
bin | 10011111001010000… |
… | …11011011010001111 |
3 | 1000120101000022111020 |
4 | 21330220123122033 |
5 | 133333303014112 |
6 | 4523504525223 |
7 | 525453133512 |
oct | 117450333217 |
9 | 30511008436 |
10 | 10680907407 |
11 | 4591103905 |
12 | 20a1020813 |
13 | 1012aa3471 |
14 | 73476ad79 |
15 | 427a5d48c |
hex | 27ca1b68f |
10680907407 has 16 divisors (see below), whose sum is σ = 15137619552. Its totient is φ = 6675660800.
The previous prime is 10680907387. The next prime is 10680907427. The reversal of 10680907407 is 70470908601.
It is an interprime number because it is at equal distance from previous prime (10680907387) and next prime (10680907427).
It is a cyclic number.
It is not a de Polignac number, because 10680907407 - 28 = 10680907151 is a prime.
It is a super-2 number, since 2×106809074072 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10680907427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 394344 + ... + 420557.
It is an arithmetic number, because the mean of its divisors is an integer number (946101222).
Almost surely, 210680907407 is an apocalyptic number.
10680907407 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
10680907407 is a deficient number, since it is larger than the sum of its proper divisors (4456712145).
10680907407 is a wasteful number, since it uses less digits than its factorization.
10680907407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 815178.
The product of its (nonzero) digits is 84672, while the sum is 42.
The spelling of 10680907407 in words is "ten billion, six hundred eighty million, nine hundred seven thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •