Base | Representation |
---|---|
bin | 10011111100010110… |
… | …01000101011111001 |
3 | 1000122011200221002101 |
4 | 21332023020223321 |
5 | 133411414023334 |
6 | 4530231303401 |
7 | 526216103461 |
oct | 117613105371 |
9 | 30564627071 |
10 | 10706782969 |
11 | 45a4777573 |
12 | 20a981ab61 |
13 | 101826304c |
14 | 737d84ba1 |
15 | 429e70214 |
hex | 27e2c8af9 |
10706782969 has 8 divisors (see below), whose sum is σ = 11383094592. Its totient is φ = 10048038000.
The previous prime is 10706782949. The next prime is 10706782993. The reversal of 10706782969 is 96928760701.
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 10706782969 - 211 = 10706780921 is a prime.
It is a super-2 number, since 2×107067829692 (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 (10706782909) 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 7 ways as a sum of consecutive naturals, for example, 4390407 + ... + 4392844.
It is an arithmetic number, because the mean of its divisors is an integer number (1422886824).
Almost surely, 210706782969 is an apocalyptic number.
It is an amenable number.
10706782969 is a deficient number, since it is larger than the sum of its proper divisors (676311623).
10706782969 is an equidigital number, since it uses as much as digits as its factorization.
10706782969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8783327.
The product of its (nonzero) digits is 2286144, while the sum is 55.
It can be divided in two parts, 107067 and 82969, that added together give a triangular number (190036 = T616).
The spelling of 10706782969 in words is "ten billion, seven hundred six million, seven hundred eighty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •