Base | Representation |
---|---|
bin | 110001110110100001… |
… | …1000101111011100101 |
3 | 101020022221011202122012 |
4 | 1203231003011323211 |
5 | 3223222343213041 |
6 | 121103030244005 |
7 | 10506644623013 |
oct | 1435503057345 |
9 | 336287152565 |
10 | 107056226021 |
11 | 414474a3158 |
12 | 188b8ab6605 |
13 | a131670904 |
14 | 52782558b3 |
15 | 2bb895d3eb |
hex | 18ed0c5ee5 |
107056226021 has 4 divisors (see below), whose sum is σ = 109334018112. Its totient is φ = 104778433932.
The previous prime is 107056225961. The next prime is 107056226027. The reversal of 107056226021 is 120622650701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 107056226021 - 210 = 107056224997 is a prime.
It is a super-2 number, since 2×1070562260212 (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 (107056226027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1138895975 + ... + 1138896068.
It is an arithmetic number, because the mean of its divisors is an integer number (27333504528).
Almost surely, 2107056226021 is an apocalyptic number.
It is an amenable number.
107056226021 is a deficient number, since it is larger than the sum of its proper divisors (2277792091).
107056226021 is an equidigital number, since it uses as much as digits as its factorization.
107056226021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2277792090.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 107056226021 its reverse (120622650701), we get a palindrome (227678876722).
The spelling of 107056226021 in words is "one hundred seven billion, fifty-six million, two hundred twenty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •