Base | Representation |
---|---|
bin | 110001101101110100… |
… | …0101110001011010001 |
3 | 101012120120111020111020 |
4 | 1203123220232023101 |
5 | 3222123102202210 |
6 | 121014033110053 |
7 | 10466466610362 |
oct | 1433350561321 |
9 | 335516436436 |
10 | 106764100305 |
11 | 41307607845 |
12 | 188370b8329 |
13 | a0b5c9bc65 |
14 | 524b531b69 |
15 | 2b9cea7770 |
hex | 18dba2e2d1 |
106764100305 has 16 divisors (see below), whose sum is σ = 171439255104. Its totient is φ = 56735288640.
The previous prime is 106764100301. The next prime is 106764100307. The reversal of 106764100305 is 503001467601.
It is not a de Polignac number, because 106764100305 - 22 = 106764100301 is a prime.
It is a super-2 number, since 2×1067641003052 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106764100301) 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 15 ways as a sum of consecutive naturals, for example, 12843511 + ... + 12851820.
It is an arithmetic number, because the mean of its divisors is an integer number (10714953444).
Almost surely, 2106764100305 is an apocalyptic number.
106764100305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106764100305 is a deficient number, since it is larger than the sum of its proper divisors (64675154799).
106764100305 is a wasteful number, since it uses less digits than its factorization.
106764100305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25695616.
The product of its (nonzero) digits is 15120, while the sum is 33.
Adding to 106764100305 its reverse (503001467601), we get a palindrome (609765567906).
The spelling of 106764100305 in words is "one hundred six billion, seven hundred sixty-four million, one hundred thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •