Base | Representation |
---|---|
bin | 1001010100010… |
… | …10110101110001 |
3 | 12110002002220112 |
4 | 10222022311301 |
5 | 130002211223 |
6 | 11431151105 |
7 | 1636243244 |
oct | 452126561 |
9 | 173062815 |
10 | 78163313 |
11 | 40137288 |
12 | 22215495 |
13 | 132693a7 |
14 | a54925b |
15 | 6cde778 |
hex | 4a8ad71 |
78163313 has 2 divisors, whose sum is σ = 78163314. Its totient is φ = 78163312.
The previous prime is 78163249. The next prime is 78163357. The reversal of 78163313 is 31336187.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41886784 + 36276529 = 6472^2 + 6023^2 .
It is a cyclic number.
It is not a de Polignac number, because 78163313 - 26 = 78163249 is a prime.
It is a super-2 number, since 2×781633132 = 12219006998271938, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 78163313.
It is not a weakly prime, because it can be changed into another prime (78163213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 39081656 + 39081657.
It is an arithmetic number, because the mean of its divisors is an integer number (39081657).
Almost surely, 278163313 is an apocalyptic number.
It is an amenable number.
78163313 is a deficient number, since it is larger than the sum of its proper divisors (1).
78163313 is an equidigital number, since it uses as much as digits as its factorization.
78163313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9072, while the sum is 32.
The square root of 78163313 is about 8841.0018097498. The cubic root of 78163313 is about 427.5638571778.
Subtracting from 78163313 its sum of digits (32), we obtain a square (78163281 = 88412).
The spelling of 78163313 in words is "seventy-eight million, one hundred sixty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •