Base | Representation |
---|---|
bin | 11000010000000111110110… |
… | …111011010100000111000001 |
3 | 111222122200212001102022110022 |
4 | 120100013312323110013001 |
5 | 102440013330243334234 |
6 | 1014503230031543225 |
7 | 31316002431452066 |
oct | 3020076673240701 |
9 | 458580761368408 |
10 | 106661065605569 |
11 | 30a92781982442 |
12 | bb6776708ab15 |
13 | 476913158ab57 |
14 | 1c4a5cd082c6d |
15 | c4e774667e2e |
hex | 6101f6ed41c1 |
106661065605569 has 8 divisors (see below), whose sum is σ = 106998972769920. Its totient is φ = 106323252829200.
The previous prime is 106661065605557. The next prime is 106661065605571. The reversal of 106661065605569 is 965506560166601.
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 106661065605569 - 220 = 106661064556993 is a prime.
It is a super-2 number, since 2×1066610656055692 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106661065605599) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21333017 + ... + 25853814.
It is an arithmetic number, because the mean of its divisors is an integer number (13374871596240).
Almost surely, 2106661065605569 is an apocalyptic number.
It is an amenable number.
106661065605569 is a deficient number, since it is larger than the sum of its proper divisors (337907164351).
106661065605569 is an equidigital number, since it uses as much as digits as its factorization.
106661065605569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47193991.
The product of its (nonzero) digits is 52488000, while the sum is 62.
The spelling of 106661065605569 in words is "one hundred six trillion, six hundred sixty-one billion, sixty-five million, six hundred five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •