Base | Representation |
---|---|
bin | 110001111011000001… |
… | …1000110101110010101 |
3 | 101020201110022021012211 |
4 | 1203312003012232111 |
5 | 3224030022133323 |
6 | 121130022513421 |
7 | 10513460240665 |
oct | 1436603065625 |
9 | 336643267184 |
10 | 107207224213 |
11 | 41514757351 |
12 | 1893b595871 |
13 | a156a2bc5b |
14 | 52903201a5 |
15 | 2bc6d3870d |
hex | 18f60c6b95 |
107207224213 has 2 divisors, whose sum is σ = 107207224214. Its totient is φ = 107207224212.
The previous prime is 107207224207. The next prime is 107207224261. The reversal of 107207224213 is 312422702701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79844109489 + 27363114724 = 282567^2 + 165418^2 .
It is a cyclic number.
It is not a de Polignac number, because 107207224213 - 29 = 107207223701 is a prime.
It is a super-2 number, since 2×1072072242132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107207224283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53603612106 + 53603612107.
It is an arithmetic number, because the mean of its divisors is an integer number (53603612107).
Almost surely, 2107207224213 is an apocalyptic number.
It is an amenable number.
107207224213 is a deficient number, since it is larger than the sum of its proper divisors (1).
107207224213 is an equidigital number, since it uses as much as digits as its factorization.
107207224213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9408, while the sum is 31.
Adding to 107207224213 its reverse (312422702701), we get a palindrome (419629926914).
The spelling of 107207224213 in words is "one hundred seven billion, two hundred seven million, two hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.300 sec. • engine limits •