Base | Representation |
---|---|
bin | 1100110001011… |
… | …01101001000101 |
3 | 21110121100210011 |
4 | 12120231221011 |
5 | 204412013301 |
6 | 14344230221 |
7 | 2440455322 |
oct | 630555105 |
9 | 243540704 |
10 | 107141701 |
11 | 5552a167 |
12 | 2ba6b371 |
13 | 19274374 |
14 | 1032db49 |
15 | 9615a51 |
hex | 662da45 |
107141701 has 8 divisors (see below), whose sum is σ = 113543640. Its totient is φ = 100750848.
The previous prime is 107141669. The next prime is 107141707.
107141701 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 78304801 + 28836900 = 8849^2 + 5370^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 107141701 - 25 = 107141669 is a prime.
It is a super-2 number, since 2×1071417012 = 22958688186346802, which 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 (107141707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25395 + ... + 29311.
It is an arithmetic number, because the mean of its divisors is an integer number (14192955).
Almost surely, 2107141701 is an apocalyptic number.
It is an amenable number.
107141701 is a deficient number, since it is larger than the sum of its proper divisors (6401939).
107141701 is a wasteful number, since it uses less digits than its factorization.
107141701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5543.
The product of its (nonzero) digits is 196, while the sum is 22.
The square root of 107141701 is about 10350.9275429789. The cubic root of 107141701 is about 474.9554174223.
The spelling of 107141701 in words is "one hundred seven million, one hundred forty-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •