Base | Representation |
---|---|
bin | 110001111001010110… |
… | …1011010100000000101 |
3 | 101020120112220021020012 |
4 | 1203302231122200011 |
5 | 3223421202101110 |
6 | 121120302120005 |
7 | 10512210140525 |
oct | 1436255324005 |
9 | 336515807205 |
10 | 107151206405 |
11 | 41496076341 |
12 | 18924880005 |
13 | a148247719 |
14 | 5286adb685 |
15 | 2bc1e70905 |
hex | 18f2b5a805 |
107151206405 has 8 divisors (see below), whose sum is σ = 128593755384. Its totient is φ = 85712760000.
The previous prime is 107151206359. The next prime is 107151206413. The reversal of 107151206405 is 504602151701.
It can be written as a sum of positive squares in 4 ways, for example, as 5355751489 + 101795454916 = 73183^2 + 319054^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107151206405 - 216 = 107151140869 is a prime.
It is a super-2 number, since 2×1071512064052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 967886 + ... + 1072895.
It is an arithmetic number, because the mean of its divisors is an integer number (16074219423).
Almost surely, 2107151206405 is an apocalyptic number.
It is an amenable number.
107151206405 is a deficient number, since it is larger than the sum of its proper divisors (21442548979).
107151206405 is a wasteful number, since it uses less digits than its factorization.
107151206405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2051287.
The product of its (nonzero) digits is 8400, while the sum is 32.
The spelling of 107151206405 in words is "one hundred seven billion, one hundred fifty-one million, two hundred six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •