Base | Representation |
---|---|
bin | 110001101000001111… |
… | …0001001001111011101 |
3 | 101012002112000021212200 |
4 | 1203100132021033131 |
5 | 3221232123400310 |
6 | 120543302122113 |
7 | 10462033444662 |
oct | 1432036111735 |
9 | 335075007780 |
10 | 106576778205 |
11 | 412208a3997 |
12 | 187a4420339 |
13 | a086233391 |
14 | 52306cda69 |
15 | 2b8b8049c0 |
hex | 18d07893dd |
106576778205 has 48 divisors (see below), whose sum is σ = 190005678720. Its totient is φ = 55223144064.
The previous prime is 106576778201. The next prime is 106576778207. The reversal of 106576778205 is 502877675601.
It is a happy number.
It is not a de Polignac number, because 106576778205 - 22 = 106576778201 is a prime.
It is a super-2 number, since 2×1065767782052 (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 (106576778201) 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 47 ways as a sum of consecutive naturals, for example, 1090336 + ... + 1184054.
It is an arithmetic number, because the mean of its divisors is an integer number (3958451640).
Almost surely, 2106576778205 is an apocalyptic number.
106576778205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106576778205 is a deficient number, since it is larger than the sum of its proper divisors (83428900515).
106576778205 is a wasteful number, since it uses less digits than its factorization.
106576778205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94450 (or 94447 counting only the distinct ones).
The product of its (nonzero) digits is 4939200, while the sum is 54.
The spelling of 106576778205 in words is "one hundred six billion, five hundred seventy-six million, seven hundred seventy-eight thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •