Base | Representation |
---|---|
bin | 110001100010110011… |
… | …1101000001001001101 |
3 | 101011121211102111200221 |
4 | 1203011213220021031 |
5 | 3220344021332301 |
6 | 120513235551341 |
7 | 10454363103412 |
oct | 1430547501115 |
9 | 334554374627 |
10 | 106394714701 |
11 | 41138051990 |
12 | 1875345b551 |
13 | a0575b91b2 |
14 | 521445a109 |
15 | 2b7a83eda1 |
hex | 18c59e824d |
106394714701 has 16 divisors (see below), whose sum is σ = 119923545600. Its totient is φ = 93514507200.
The previous prime is 106394714663. The next prime is 106394714753. The reversal of 106394714701 is 107417493601.
It is a cyclic number.
It is not a de Polignac number, because 106394714701 - 215 = 106394681933 is a prime.
It is a super-2 number, since 2×1063947147012 (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 (106394714201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 218595 + ... + 510463.
It is an arithmetic number, because the mean of its divisors is an integer number (7495221600).
Almost surely, 2106394714701 is an apocalyptic number.
106394714701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106394714701 is a deficient number, since it is larger than the sum of its proper divisors (13528830899).
106394714701 is a wasteful number, since it uses less digits than its factorization.
106394714701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292980.
The product of its (nonzero) digits is 127008, while the sum is 43.
The spelling of 106394714701 in words is "one hundred six billion, three hundred ninety-four million, seven hundred fourteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •