Base | Representation |
---|---|
bin | 1001000111101010110… |
… | …11000100110100010011 |
3 | 1002221211021000111022012 |
4 | 10203311123010310103 |
5 | 20113222410121401 |
6 | 355541532333135 |
7 | 31432142630345 |
oct | 4436533046423 |
9 | 1087737014265 |
10 | 313355160851 |
11 | 110990901317 |
12 | 508920141ab |
13 | 2371a972855 |
14 | 11248b1d295 |
15 | 823edb88bb |
hex | 48f56c4d13 |
313355160851 has 2 divisors, whose sum is σ = 313355160852. Its totient is φ = 313355160850.
The previous prime is 313355160827. The next prime is 313355160863. The reversal of 313355160851 is 158061553313.
It is a strong prime.
It is an emirp because it is prime and its reverse (158061553313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313355160851 - 230 = 312281419027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 313355160799 and 313355160808.
It is not a weakly prime, because it can be changed into another prime (313355162851) 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, 156677580425 + 156677580426.
It is an arithmetic number, because the mean of its divisors is an integer number (156677580426).
Almost surely, 2313355160851 is an apocalyptic number.
313355160851 is a deficient number, since it is larger than the sum of its proper divisors (1).
313355160851 is an equidigital number, since it uses as much as digits as its factorization.
313355160851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 313355160851 in words is "three hundred thirteen billion, three hundred fifty-five million, one hundred sixty thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •