Base | Representation |
---|---|
bin | 11000001111110111010000… |
… | …100000001110111111001000 |
3 | 111222120222211211110210001202 |
4 | 120033313100200032333020 |
5 | 102434220324210301204 |
6 | 1014451121215003332 |
7 | 31314501633624143 |
oct | 3017672040167710 |
9 | 458528754423052 |
10 | 106643241103304 |
11 | 30a86165468034 |
12 | bb64211809548 |
13 | 47675508160a9 |
14 | 1c497bba9b05a |
15 | c4e07e8c8e1e |
hex | 60fdd080efc8 |
106643241103304 has 16 divisors (see below), whose sum is σ = 200167223943600. Its totient is φ = 53265314718352.
The previous prime is 106643241103303. The next prime is 106643241103349. The reversal of 106643241103304 is 403301142346601.
It is a super-2 number, since 2×1066432411033042 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106643241103303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7038221114 + ... + 7038236265.
It is an arithmetic number, because the mean of its divisors is an integer number (12510451496475).
Almost surely, 2106643241103304 is an apocalyptic number.
It is an amenable number.
106643241103304 is a deficient number, since it is larger than the sum of its proper divisors (93523982840296).
106643241103304 is a wasteful number, since it uses less digits than its factorization.
106643241103304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14076458332 (or 14076458328 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 38.
Adding to 106643241103304 its reverse (403301142346601), we get a palindrome (509944383449905).
The spelling of 106643241103304 in words is "one hundred six trillion, six hundred forty-three billion, two hundred forty-one million, one hundred three thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •