Base | Representation |
---|---|
bin | 11000000111011101001100… |
… | …110110001111000011111101 |
3 | 111220112202121112012020011221 |
4 | 120013131030312033003331 |
5 | 102400234124201114410 |
6 | 1013325453204513341 |
7 | 31224660063113302 |
oct | 3007351466170375 |
9 | 456482545166157 |
10 | 106065506660605 |
11 | 3088314642a268 |
12 | ba902576ab851 |
13 | 4724c1ba3947b |
14 | 1c298529630a9 |
15 | c3e0196434da |
hex | 60774cd8f0fd |
106065506660605 has 8 divisors (see below), whose sum is σ = 127280516017464. Its totient is φ = 84851133312000.
The previous prime is 106065506660551. The next prime is 106065506660647. The reversal of 106065506660605 is 506066605560601.
It can be written as a sum of positive squares in 4 ways, for example, as 25496248483161 + 80569258177444 = 5049381^2 + 8976038^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106065506660605 - 29 = 106065506660093 is a prime.
It is a super-2 number, since 2×1060655066606052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158635096 + ... + 159302305.
It is an arithmetic number, because the mean of its divisors is an integer number (15910064502183).
Almost surely, 2106065506660605 is an apocalyptic number.
It is an amenable number.
106065506660605 is a deficient number, since it is larger than the sum of its proper divisors (21215009356859).
106065506660605 is an equidigital number, since it uses as much as digits as its factorization.
106065506660605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 318004127.
The product of its (nonzero) digits is 5832000, while the sum is 52.
The spelling of 106065506660605 in words is "one hundred six trillion, sixty-five billion, five hundred six million, six hundred sixty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •