Base | Representation |
---|---|
bin | 11000000000000010101111… |
… | …011101101001010010101101 |
3 | 111211202001122022112000011222 |
4 | 120000002233131221102231 |
5 | 102313412302333104410 |
6 | 1012255441243553125 |
7 | 31143113366302613 |
oct | 3000025735512255 |
9 | 454661568460158 |
10 | 105556060050605 |
11 | 306a708a06a96a |
12 | ba0957ab2b7a5 |
13 | 46b8b8075a748 |
14 | 1c0cd24cad6b3 |
15 | c30b4e514955 |
hex | 6000af7694ad |
105556060050605 has 8 divisors (see below), whose sum is σ = 126667500702072. Its totient is φ = 84444695612928.
The previous prime is 105556060050587. The next prime is 105556060050631. The reversal of 105556060050605 is 506050060655501.
It can be written as a sum of positive squares in 4 ways, for example, as 64563362327689 + 40992697722916 = 8035133^2 + 6402554^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105556060050605 is a prime.
It is a super-2 number, since 2×1055560600506052 (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, 15960812 + ... + 21583781.
It is an arithmetic number, because the mean of its divisors is an integer number (15833437587759).
Almost surely, 2105556060050605 is an apocalyptic number.
It is an amenable number.
105556060050605 is a deficient number, since it is larger than the sum of its proper divisors (21111440651467).
105556060050605 is an equidigital number, since it uses as much as digits as its factorization.
105556060050605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38106895.
The product of its (nonzero) digits is 675000, while the sum is 44.
The spelling of 105556060050605 in words is "one hundred five trillion, five hundred fifty-six billion, sixty million, fifty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •