Base | Representation |
---|---|
bin | 10111111000101011011111… |
… | …100000110111011101011111 |
3 | 111202221200120022021012212010 |
4 | 113320223133200313131133 |
5 | 102232120010333414021 |
6 | 1011231155324042303 |
7 | 31061421263325606 |
oct | 2770533740673537 |
9 | 452850508235763 |
10 | 105050060060511 |
11 | 30521531289075 |
12 | b9474a4693393 |
13 | 4680241548597 |
14 | 1bd2642c80a3d |
15 | c228d6c9b976 |
hex | 5f8adf83775f |
105050060060511 has 8 divisors (see below), whose sum is σ = 140253253736704. Its totient is φ = 69940119879000.
The previous prime is 105050060060489. The next prime is 105050060060513. The reversal of 105050060060511 is 115060060050501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105050060060511 - 213 = 105050060052319 is a prime.
It is a super-2 number, since 2×1050500600605112 (a number of 29 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 (105050060060513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23313371041 + ... + 23313375546.
It is an arithmetic number, because the mean of its divisors is an integer number (17531656717088).
Almost surely, 2105050060060511 is an apocalyptic number.
105050060060511 is a deficient number, since it is larger than the sum of its proper divisors (35203193676193).
105050060060511 is an equidigital number, since it uses as much as digits as its factorization.
105050060060511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46626747341.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 105050060060511 in words is "one hundred five trillion, fifty billion, sixty million, sixty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •