Base | Representation |
---|---|
bin | 110000111100101110… |
… | …1010111001010110000 |
3 | 101001022210002121100010 |
4 | 1201321131113022300 |
5 | 3210234420032222 |
6 | 120142353054520 |
7 | 10410616243365 |
oct | 1417135271260 |
9 | 331283077303 |
10 | 105116955312 |
11 | 40641865396 |
12 | 18457557440 |
13 | 9bb296a455 |
14 | 513288846c |
15 | 2b0359480c |
hex | 18797572b0 |
105116955312 has 40 divisors (see below), whose sum is σ = 272034535104. Its totient is φ = 34976739904.
The previous prime is 105116955301. The next prime is 105116955343. The reversal of 105116955312 is 213559611501.
It is a super-2 number, since 2×1051169553122 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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, 1917858 + ... + 1971905.
Almost surely, 2105116955312 is an apocalyptic number.
105116955312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105116955312 is an abundant number, since it is smaller than the sum of its proper divisors (166917579792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105116955312 is a wasteful number, since it uses less digits than its factorization.
105116955312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3890337 (or 3890331 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 39.
The spelling of 105116955312 in words is "one hundred five billion, one hundred sixteen million, nine hundred fifty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •