Base | Representation |
---|---|
bin | 1100110000110… |
… | …10000010100011 |
3 | 21110110021122110 |
4 | 12120122002203 |
5 | 204401431121 |
6 | 14342410403 |
7 | 2440002252 |
oct | 630320243 |
9 | 243407573 |
10 | 107061411 |
11 | 55484906 |
12 | 2ba30a03 |
13 | 19246962 |
14 | 1030c799 |
15 | 95ebd76 |
hex | 661a0a3 |
107061411 has 4 divisors (see below), whose sum is σ = 142748552. Its totient is φ = 71374272.
The previous prime is 107061391. The next prime is 107061413. The reversal of 107061411 is 114160701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 114160701 = 3 ⋅38053567.
It is not a de Polignac number, because 107061411 - 25 = 107061379 is a prime.
It is a super-2 number, since 2×1070614112 = 22924291450621842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107061413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17843566 + ... + 17843571.
It is an arithmetic number, because the mean of its divisors is an integer number (35687138).
Almost surely, 2107061411 is an apocalyptic number.
107061411 is a deficient number, since it is larger than the sum of its proper divisors (35687141).
107061411 is an equidigital number, since it uses as much as digits as its factorization.
107061411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35687140.
The product of its (nonzero) digits is 168, while the sum is 21.
The square root of 107061411 is about 10347.0484197185. The cubic root of 107061411 is about 474.8367468526.
It can be divided in two parts, 1070 and 61411, that added together give a triangular number (62481 = T353).
The spelling of 107061411 in words is "one hundred seven million, sixty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •