Base | Representation |
---|---|
bin | 1100110001111… |
… | …11010011000101 |
3 | 21110202000222200 |
4 | 12120333103011 |
5 | 204421322041 |
6 | 14345545113 |
7 | 2441206215 |
oct | 630772305 |
9 | 243660880 |
10 | 107214021 |
11 | 55579532 |
12 | 2baa5199 |
13 | 1929b265 |
14 | 1034c245 |
15 | 962c1b6 |
hex | 663f4c5 |
107214021 has 6 divisors (see below), whose sum is σ = 154864710. Its totient is φ = 71476008.
The previous prime is 107214013. The next prime is 107214031. The reversal of 107214021 is 120412701.
It can be written as a sum of positive squares in only one way, i.e., 94361796 + 12852225 = 9714^2 + 3585^2 .
It is not a de Polignac number, because 107214021 - 23 = 107214013 is a prime.
It is a super-2 number, since 2×1072140212 = 22989692597976882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107213985 and 107214003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107214031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5956326 + ... + 5956343.
It is an arithmetic number, because the mean of its divisors is an integer number (25810785).
Almost surely, 2107214021 is an apocalyptic number.
It is an amenable number.
107214021 is a deficient number, since it is larger than the sum of its proper divisors (47650689).
107214021 is a wasteful number, since it uses less digits than its factorization.
107214021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11912675 (or 11912672 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 18.
The square root of 107214021 is about 10354.4203604065. The cubic root of 107214021 is about 475.0622573983.
Adding to 107214021 its reverse (120412701), we get a palindrome (227626722).
The spelling of 107214021 in words is "one hundred seven million, two hundred fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •