Base | Representation |
---|---|
bin | 110010001100101011… |
… | …1101110100011000001 |
3 | 101022020202101220022212 |
4 | 1210121113232203001 |
5 | 3231233224122034 |
6 | 121304512311505 |
7 | 10534244313506 |
oct | 1443127564301 |
9 | 338222356285 |
10 | 107799832769 |
11 | 41799216992 |
12 | 18a85b42595 |
13 | a21c73a3c5 |
14 | 5308d014ad |
15 | 2c0dd962ce |
hex | 19195ee8c1 |
107799832769 has 2 divisors, whose sum is σ = 107799832770. Its totient is φ = 107799832768.
The previous prime is 107799832757. The next prime is 107799832783. The reversal of 107799832769 is 967238997701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101872680625 + 5927152144 = 319175^2 + 76988^2 .
It is an emirp because it is prime and its reverse (967238997701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107799832769 - 28 = 107799832513 is a prime.
It is a super-2 number, since 2×1077998327692 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107799832699 and 107799832708.
It is not a weakly prime, because it can be changed into another prime (107799832669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53899916384 + 53899916385.
It is an arithmetic number, because the mean of its divisors is an integer number (53899916385).
Almost surely, 2107799832769 is an apocalyptic number.
It is an amenable number.
107799832769 is a deficient number, since it is larger than the sum of its proper divisors (1).
107799832769 is an equidigital number, since it uses as much as digits as its factorization.
107799832769 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72013536, while the sum is 68.
The spelling of 107799832769 in words is "one hundred seven billion, seven hundred ninety-nine million, eight hundred thirty-two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •