Base | Representation |
---|---|
bin | 10011111001010110… |
… | …11101111111010001 |
3 | 1000120102111210202112 |
4 | 21330223131333101 |
5 | 133334004020101 |
6 | 4523533555105 |
7 | 525462663224 |
oct | 117453357721 |
9 | 30512453675 |
10 | 10681704401 |
11 | 45915a8685 |
12 | 20a1345a95 |
13 | 1012cc2164 |
14 | 7348d75bb |
15 | 427b696bb |
hex | 27caddfd1 |
10681704401 has 4 divisors (see below), whose sum is σ = 11310039972. Its totient is φ = 10053368832.
The previous prime is 10681704377. The next prime is 10681704409. The reversal of 10681704401 is 10440718601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10440718601 = 23 ⋅453944287.
It can be written as a sum of positive squares in 2 ways, for example, as 5385358225 + 5296346176 = 73385^2 + 72776^2 .
It is a cyclic number.
It is not a de Polignac number, because 10681704401 - 26 = 10681704337 is a prime.
It is a super-2 number, since 2×106817044012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10681704409) 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, 314167760 + ... + 314167793.
It is an arithmetic number, because the mean of its divisors is an integer number (2827509993).
Almost surely, 210681704401 is an apocalyptic number.
It is an amenable number.
10681704401 is a deficient number, since it is larger than the sum of its proper divisors (628335571).
10681704401 is an equidigital number, since it uses as much as digits as its factorization.
10681704401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 628335570.
The product of its (nonzero) digits is 5376, while the sum is 32.
The spelling of 10681704401 in words is "ten billion, six hundred eighty-one million, seven hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •