Base | Representation |
---|---|
bin | 110001111010110110… |
… | …0111100000010010001 |
3 | 101020201001101001002112 |
4 | 1203311230330002101 |
5 | 3224022030211030 |
6 | 121125254155105 |
7 | 10513356656312 |
oct | 1436554740221 |
9 | 336631331075 |
10 | 107201413265 |
11 | 41511448511 |
12 | 18939652a95 |
13 | a15577601b |
14 | 528d64a609 |
15 | 2bc658ba95 |
hex | 18f5b3c091 |
107201413265 has 4 divisors (see below), whose sum is σ = 128641695924. Its totient is φ = 85761130608.
The previous prime is 107201413259. The next prime is 107201413309. The reversal of 107201413265 is 562314102701.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46018401361 + 61183011904 = 214519^2 + 247352^2 .
It is a cyclic number.
It is not a de Polignac number, because 107201413265 - 26 = 107201413201 is a prime.
It is a super-2 number, since 2×1072014132652 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10720141322 + ... + 10720141331.
It is an arithmetic number, because the mean of its divisors is an integer number (32160423981).
Almost surely, 2107201413265 is an apocalyptic number.
It is an amenable number.
107201413265 is a deficient number, since it is larger than the sum of its proper divisors (21440282659).
107201413265 is an equidigital number, since it uses as much as digits as its factorization.
107201413265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21440282658.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 107201413265 its reverse (562314102701), we get a palindrome (669515515966).
The spelling of 107201413265 in words is "one hundred seven billion, two hundred one million, four hundred thirteen thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.221 sec. • engine limits •