Base | Representation |
---|---|
bin | 110001101100010001… |
… | …1101010111101000110 |
3 | 101012102222021212101020 |
4 | 1203120203222331012 |
5 | 3222021341212432 |
6 | 121004550012010 |
7 | 10465301546151 |
oct | 1433043527506 |
9 | 335388255336 |
10 | 106712444742 |
11 | 412904361a2 |
12 | 18821947006 |
13 | a0a8384137 |
14 | 5244726c98 |
15 | 2b986a222c |
hex | 18d88eaf46 |
106712444742 has 8 divisors (see below), whose sum is σ = 213424889496. Its totient is φ = 35570814912.
The previous prime is 106712444687. The next prime is 106712444767. The reversal of 106712444742 is 247444217601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
106712444742 is an admirable number.
It is a super-2 number, since 2×1067124447422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106712444694 and 106712444703.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 8892703723 + ... + 8892703734.
It is an arithmetic number, because the mean of its divisors is an integer number (26678111187).
Almost surely, 2106712444742 is an apocalyptic number.
106712444742 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106712444742 is a wasteful number, since it uses less digits than its factorization.
106712444742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17785407462.
The product of its (nonzero) digits is 301056, while the sum is 42.
The spelling of 106712444742 in words is "one hundred six billion, seven hundred twelve million, four hundred forty-four thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •