Base | Representation |
---|---|
bin | 110001101111010010… |
… | …0100000011011100001 |
3 | 101012201000010012220212 |
4 | 1203132210200123201 |
5 | 3222223202431243 |
6 | 121022552143505 |
7 | 10500635204555 |
oct | 1433644403341 |
9 | 335630105825 |
10 | 106813327073 |
11 | 4133237a622 |
12 | 1884b697b95 |
13 | a0c324641b |
14 | 5253ca7865 |
15 | 2ba247d318 |
hex | 18de9206e1 |
106813327073 has 2 divisors, whose sum is σ = 106813327074. Its totient is φ = 106813327072.
The previous prime is 106813327069. The next prime is 106813327157. The reversal of 106813327073 is 370723318601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103338460369 + 3474866704 = 321463^2 + 58948^2 .
It is a cyclic number.
It is not a de Polignac number, because 106813327073 - 22 = 106813327069 is a prime.
It is a super-2 number, since 2×1068133270732 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106813327073.
It is not a weakly prime, because it can be changed into another prime (106813317073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53406663536 + 53406663537.
It is an arithmetic number, because the mean of its divisors is an integer number (53406663537).
Almost surely, 2106813327073 is an apocalyptic number.
It is an amenable number.
106813327073 is a deficient number, since it is larger than the sum of its proper divisors (1).
106813327073 is an equidigital number, since it uses as much as digits as its factorization.
106813327073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 106813327073 in words is "one hundred six billion, eight hundred thirteen million, three hundred twenty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •