Base | Representation |
---|---|
bin | 110001011001010000… |
… | …1101010110110110101 |
3 | 101010210111200010010020 |
4 | 1202302201222312311 |
5 | 3214220020321340 |
6 | 120421354115353 |
7 | 10443423255141 |
oct | 1426241526665 |
9 | 333714603106 |
10 | 106074385845 |
11 | 40a9325309a |
12 | 1868411bb59 |
13 | a0061213ac |
14 | 51c3ab4221 |
15 | 2b5c6679d0 |
hex | 18b286adb5 |
106074385845 has 8 divisors (see below), whose sum is σ = 169719017376. Its totient is φ = 56573005776.
The previous prime is 106074385763. The next prime is 106074385849. The reversal of 106074385845 is 548583470601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106074385845 - 27 = 106074385717 is a prime.
It is a super-2 number, since 2×1060743858452 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106074385849) 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, 3535812847 + ... + 3535812876.
It is an arithmetic number, because the mean of its divisors is an integer number (21214877172).
Almost surely, 2106074385845 is an apocalyptic number.
106074385845 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106074385845 is a deficient number, since it is larger than the sum of its proper divisors (63644631531).
106074385845 is an equidigital number, since it uses as much as digits as its factorization.
106074385845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7071625731.
The product of its (nonzero) digits is 3225600, while the sum is 51.
The spelling of 106074385845 in words is "one hundred six billion, seventy-four million, three hundred eighty-five thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •