Base | Representation |
---|---|
bin | 110001100100110001… |
… | …0010001001011010101 |
3 | 101011210102001121202002 |
4 | 1203021202101023111 |
5 | 3221012331400043 |
6 | 120523544125045 |
7 | 10456121425442 |
oct | 1431142211325 |
9 | 334712047662 |
10 | 106460418773 |
11 | 41171149375 |
12 | 18771466785 |
13 | a0680b2547 |
14 | 521d0809c9 |
15 | 2b814bcbb8 |
hex | 18c98912d5 |
106460418773 has 4 divisors (see below), whose sum is σ = 107918780748. Its totient is φ = 105002056800.
The previous prime is 106460418737. The next prime is 106460418781. The reversal of 106460418773 is 377814064601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 48755731249 + 57704687524 = 220807^2 + 240218^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106460418773 is a prime.
It is a super-2 number, since 2×1064604187732 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106460418703) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 729180878 + ... + 729181023.
It is an arithmetic number, because the mean of its divisors is an integer number (26979695187).
Almost surely, 2106460418773 is an apocalyptic number.
It is an amenable number.
106460418773 is a deficient number, since it is larger than the sum of its proper divisors (1458361975).
106460418773 is an equidigital number, since it uses as much as digits as its factorization.
106460418773 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1458361974.
The product of its (nonzero) digits is 677376, while the sum is 47.
The spelling of 106460418773 in words is "one hundred six billion, four hundred sixty million, four hundred eighteen thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •