Base | Representation |
---|---|
bin | 110001001000101000… |
… | …0001010110011111011 |
3 | 101002100121020210111222 |
4 | 1202101100022303323 |
5 | 3212044113300021 |
6 | 120250133142255 |
7 | 10423534322336 |
oct | 1422120126373 |
9 | 332317223458 |
10 | 105516150011 |
11 | 40827130268 |
12 | 1854918a98b |
13 | 9c4758932c |
14 | 516d8bd61d |
15 | 2b286496ab |
hex | 189140acfb |
105516150011 has 8 divisors (see below), whose sum is σ = 107269537584. Its totient is φ = 103763524320.
The previous prime is 105516149971. The next prime is 105516150041. The reversal of 105516150011 is 110051615501.
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 105516150011 - 226 = 105449041147 is a prime.
It is a super-3 number, since 3×1055161500113 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105516150041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92276 + ... + 468558.
It is an arithmetic number, because the mean of its divisors is an integer number (13408692198).
Almost surely, 2105516150011 is an apocalyptic number.
105516150011 is a deficient number, since it is larger than the sum of its proper divisors (1753387573).
105516150011 is an equidigital number, since it uses as much as digits as its factorization.
105516150011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380941.
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 105516150011 its reverse (110051615501), we get a palindrome (215567765512).
The spelling of 105516150011 in words is "one hundred five billion, five hundred sixteen million, one hundred fifty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •