Base | Representation |
---|---|
bin | 10111111000101011011111… |
… | …111001100111110100001111 |
3 | 111202221200120202110220210201 |
4 | 113320223133321213310033 |
5 | 102232120014014100111 |
6 | 1011231200115114331 |
7 | 31061421402434521 |
oct | 2770533771476417 |
9 | 452850522426721 |
10 | 105050066550031 |
11 | 30521534a10809 |
12 | b9474a68a29a7 |
13 | 46802429ab335 |
14 | 1bd2643a8da11 |
15 | c228d762e6c1 |
hex | 5f8adfe67d0f |
105050066550031 has 4 divisors (see below), whose sum is σ = 105057907876152. Its totient is φ = 105042225223912.
The previous prime is 105050066549873. The next prime is 105050066550047. The reversal of 105050066550031 is 130055660050501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105050066550031 - 213 = 105050066541839 is a prime.
It is a super-2 number, since 2×1050500665500312 (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 (105050066550061) 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 3 ways as a sum of consecutive naturals, for example, 3920642965 + ... + 3920669758.
It is an arithmetic number, because the mean of its divisors is an integer number (26264476969038).
Almost surely, 2105050066550031 is an apocalyptic number.
105050066550031 is a deficient number, since it is larger than the sum of its proper divisors (7841326121).
105050066550031 is an equidigital number, since it uses as much as digits as its factorization.
105050066550031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7841326120.
The product of its (nonzero) digits is 67500, while the sum is 37.
The spelling of 105050066550031 in words is "one hundred five trillion, fifty billion, sixty-six million, five hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •