Base | Representation |
---|---|
bin | 110001110101001011… |
… | …1111011000111010011 |
3 | 101020012210202002021220 |
4 | 1203222113323013103 |
5 | 3223124401330331 |
6 | 121054344420123 |
7 | 10505561336664 |
oct | 1435227730723 |
9 | 336183662256 |
10 | 107011355091 |
11 | 41424135a43 |
12 | 188a5a77643 |
13 | a12528cc74 |
14 | 52722d536b |
15 | 2bb4a48296 |
hex | 18ea5fb1d3 |
107011355091 has 8 divisors (see below), whose sum is σ = 146161851024. Its totient is φ = 69600881280.
The previous prime is 107011355057. The next prime is 107011355093. The reversal of 107011355091 is 190553110701.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107011355091 - 227 = 106877137363 is a prime.
It is a super-2 number, since 2×1070113550912 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (107011355093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 435005386 + ... + 435005631.
It is an arithmetic number, because the mean of its divisors is an integer number (18270231378).
Almost surely, 2107011355091 is an apocalyptic number.
107011355091 is a deficient number, since it is larger than the sum of its proper divisors (39150495933).
107011355091 is an equidigital number, since it uses as much as digits as its factorization.
107011355091 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 870011061.
The product of its (nonzero) digits is 4725, while the sum is 33.
Adding to 107011355091 its reverse (190553110701), we get a palindrome (297564465792).
The spelling of 107011355091 in words is "one hundred seven billion, eleven million, three hundred fifty-five thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •