Base | Representation |
---|---|
bin | 1001101110000001010101… |
… | …0001100111001000000001 |
3 | 1101211121001010112012020010 |
4 | 2123200111101213020001 |
5 | 2400040402301230224 |
6 | 34421104442535133 |
7 | 2152024610426310 |
oct | 233402521471001 |
9 | 41747033465203 |
10 | 10686235570689 |
11 | 34500094321a8 |
12 | 12470928074a9 |
13 | 5c6927a46323 |
14 | 28d30635c277 |
15 | 137e908eae29 |
hex | 9b815467201 |
10686235570689 has 8 divisors (see below), whose sum is σ = 16283787536320. Its totient is φ = 6106420326096.
The previous prime is 10686235570679. The next prime is 10686235570693. The reversal of 10686235570689 is 98607553268601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10686235570689 - 215 = 10686235537921 is a prime.
It is a super-2 number, since 2×106862355706892 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10686235570679) 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, 254434180234 + ... + 254434180275.
It is an arithmetic number, because the mean of its divisors is an integer number (2035473442040).
Almost surely, 210686235570689 is an apocalyptic number.
It is an amenable number.
10686235570689 is a deficient number, since it is larger than the sum of its proper divisors (5597551965631).
10686235570689 is an equidigital number, since it uses as much as digits as its factorization.
10686235570689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508868360519.
The product of its (nonzero) digits is 130636800, while the sum is 66.
The spelling of 10686235570689 in words is "ten trillion, six hundred eighty-six billion, two hundred thirty-five million, five hundred seventy thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •