Base | Representation |
---|---|
bin | 10100011011100000… |
… | …01111000011001111 |
3 | 1001022101112121000212 |
4 | 22031300033003033 |
5 | 134430322312412 |
6 | 5012205513035 |
7 | 535541610056 |
oct | 121560170317 |
9 | 31271477025 |
10 | 10968166607 |
11 | 4719275a02 |
12 | 216127277b |
13 | 105a460018 |
14 | 76098539d |
15 | 442da2222 |
hex | 28dc0f0cf |
10968166607 has 8 divisors (see below), whose sum is σ = 12118281696. Its totient is φ = 9874154752.
The previous prime is 10968166577. The next prime is 10968166621. The reversal of 10968166607 is 70666186901.
10968166607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10968166607 - 26 = 10968166543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10968166697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14025398 + ... + 14026179.
It is an arithmetic number, because the mean of its divisors is an integer number (1514785212).
Almost surely, 210968166607 is an apocalyptic number.
10968166607 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
10968166607 is a deficient number, since it is larger than the sum of its proper divisors (1150115089).
10968166607 is a wasteful number, since it uses less digits than its factorization.
10968166607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28051617.
The product of its (nonzero) digits is 653184, while the sum is 50.
The spelling of 10968166607 in words is "ten billion, nine hundred sixty-eight million, one hundred sixty-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •