Base | Representation |
---|---|
bin | 1001101100100000001001… |
… | …1111010111100011100111 |
3 | 1101202002201020001200201212 |
4 | 2123020002133113203213 |
5 | 2344123442023343210 |
6 | 34401112223342035 |
7 | 2150112320042606 |
oct | 233100237274347 |
9 | 41662636050655 |
10 | 10660150606055 |
11 | 343aa43120195 |
12 | 1242012a5191b |
13 | 5c432b7c4902 |
14 | 28bd4dc6ba3d |
15 | 137465862805 |
hex | 9b2027d78e7 |
10660150606055 has 4 divisors (see below), whose sum is σ = 12792180727272. Its totient is φ = 8528120484840.
The previous prime is 10660150606051. The next prime is 10660150606097. The reversal of 10660150606055 is 55060605106601.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10660150606055 - 22 = 10660150606051 is a prime.
It is a super-2 number, since 2×106601506060552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10660150606051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1066015060601 + ... + 1066015060610.
It is an arithmetic number, because the mean of its divisors is an integer number (3198045181818).
Almost surely, 210660150606055 is an apocalyptic number.
10660150606055 is a deficient number, since it is larger than the sum of its proper divisors (2132030121217).
10660150606055 is an equidigital number, since it uses as much as digits as its factorization.
10660150606055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132030121216.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 10660150606055 in words is "ten trillion, six hundred sixty billion, one hundred fifty million, six hundred six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •