Base | Representation |
---|---|
bin | 110000111100101110… |
… | …0000010111001011011 |
3 | 101001022202110001211221 |
4 | 1201321130002321123 |
5 | 3210234323011024 |
6 | 120142341432511 |
7 | 10410613305142 |
oct | 1417134027133 |
9 | 331282401757 |
10 | 105116610139 |
11 | 4064164a022 |
12 | 1845740b737 |
13 | 9bb28792c8 |
14 | 51327d8759 |
15 | 2b035273e4 |
hex | 1879702e5b |
105116610139 has 8 divisors (see below), whose sum is σ = 106144769120. Its totient is φ = 104088597696.
The previous prime is 105116610133. The next prime is 105116610149. The reversal of 105116610139 is 931016611501.
It is a happy number.
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 105116610139 - 25 = 105116610107 is a prime.
It is a super-2 number, since 2×1051166101392 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105116610133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1904767 + ... + 1959175.
It is an arithmetic number, because the mean of its divisors is an integer number (13268096140).
Almost surely, 2105116610139 is an apocalyptic number.
105116610139 is a deficient number, since it is larger than the sum of its proper divisors (1028158981).
105116610139 is a wasteful number, since it uses less digits than its factorization.
105116610139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73269.
The product of its (nonzero) digits is 4860, while the sum is 34.
The spelling of 105116610139 in words is "one hundred five billion, one hundred sixteen million, six hundred ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •