Base | Representation |
---|---|
bin | 10010101010111… |
… | …110101110111101 |
3 | 210211110002200011 |
4 | 102222332232331 |
5 | 1120143210033 |
6 | 51030103221 |
7 | 10522432255 |
oct | 2252765675 |
9 | 724402604 |
10 | 313256893 |
11 | 1509095a4 |
12 | 88aaab11 |
13 | 4cb8cc11 |
14 | 2d864965 |
15 | 1c77bccd |
hex | 12abebbd |
313256893 has 2 divisors, whose sum is σ = 313256894. Its totient is φ = 313256892.
The previous prime is 313256863. The next prime is 313256897. The reversal of 313256893 is 398652313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 308248249 + 5008644 = 17557^2 + 2238^2 .
It is an emirp because it is prime and its reverse (398652313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313256893 - 29 = 313256381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313256897) 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, 156628446 + 156628447.
It is an arithmetic number, because the mean of its divisors is an integer number (156628447).
Almost surely, 2313256893 is an apocalyptic number.
It is an amenable number.
313256893 is a deficient number, since it is larger than the sum of its proper divisors (1).
313256893 is an equidigital number, since it uses as much as digits as its factorization.
313256893 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 116640, while the sum is 40.
The square root of 313256893 is about 17699.0647493024. The cubic root of 313256893 is about 679.1518354011.
It can be divided in two parts, 3132 and 56893, that added together give a square (60025 = 2452).
The spelling of 313256893 in words is "three hundred thirteen million, two hundred fifty-six thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •