Base | Representation |
---|---|
bin | 1001000111011010000… |
… | …01110110011000101101 |
3 | 1002221110110000120021001 |
4 | 10203231001312120231 |
5 | 20112430332033123 |
6 | 355515542040301 |
7 | 31425512611105 |
oct | 4435501663055 |
9 | 1087413016231 |
10 | 313214330413 |
11 | 110919362326 |
12 | 50852a19091 |
13 | 236c773452a |
14 | 11234140205 |
15 | 823284b0ad |
hex | 48ed07662d |
313214330413 has 2 divisors, whose sum is σ = 313214330414. Its totient is φ = 313214330412.
The previous prime is 313214330381. The next prime is 313214330447. The reversal of 313214330413 is 314033412313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 299939142889 + 13275187524 = 547667^2 + 115218^2 .
It is an emirp because it is prime and its reverse (314033412313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313214330413 - 25 = 313214330381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313214330483) 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, 156607165206 + 156607165207.
It is an arithmetic number, because the mean of its divisors is an integer number (156607165207).
Almost surely, 2313214330413 is an apocalyptic number.
It is an amenable number.
313214330413 is a deficient number, since it is larger than the sum of its proper divisors (1).
313214330413 is an equidigital number, since it uses as much as digits as its factorization.
313214330413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 313214330413 its reverse (314033412313), we get a palindrome (627247742726).
The spelling of 313214330413 in words is "three hundred thirteen billion, two hundred fourteen million, three hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •