Base | Representation |
---|---|
bin | 10111111000101011111101… |
… | …000011000001111100010001 |
3 | 111202221201211211121222100010 |
4 | 113320223331003001330101 |
5 | 102232122014210234401 |
6 | 1011231320424145133 |
7 | 31061436461060655 |
oct | 2770537503017421 |
9 | 452851754558303 |
10 | 105050555555601 |
11 | 30521765a48947 |
12 | b9476026081a9 |
13 | 46802c00b4046 |
14 | 1bd268c9c2a65 |
15 | c22915524ed6 |
hex | 5f8afd0c1f11 |
105050555555601 has 8 divisors (see below), whose sum is σ = 141376448598624. Its totient is φ = 69379183108160.
The previous prime is 105050555555579. The next prime is 105050555555609. The reversal of 105050555555601 is 106555555050501.
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 105050555555601 - 231 = 105048408071953 is a prime.
It is a super-2 number, since 2×1050505555556012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105050555555609) 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, 163630148520 + ... + 163630149161.
It is an arithmetic number, because the mean of its divisors is an integer number (17672056074828).
Almost surely, 2105050555555601 is an apocalyptic number.
It is an amenable number.
105050555555601 is a deficient number, since it is larger than the sum of its proper divisors (36325893043023).
105050555555601 is a wasteful number, since it uses less digits than its factorization.
105050555555601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327260297791.
The product of its (nonzero) digits is 2343750, while the sum is 48.
The spelling of 105050555555601 in words is "one hundred five trillion, fifty billion, five hundred fifty-five million, five hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •