Base | Representation |
---|---|
bin | 1001000111110100001… |
… | …00100101001110000101 |
3 | 1002222000200202202202211 |
4 | 10203322010211032011 |
5 | 20113402341302331 |
6 | 355553400103421 |
7 | 31434110551063 |
oct | 4437204451605 |
9 | 1088020682684 |
10 | 313433150341 |
11 | 110a20929a43 |
12 | 508b4164b71 |
13 | 23730b7aa8c |
14 | 11255221033 |
15 | 8246b718b1 |
hex | 48fa125385 |
313433150341 has 2 divisors, whose sum is σ = 313433150342. Its totient is φ = 313433150340.
The previous prime is 313433150339. The next prime is 313433150357. The reversal of 313433150341 is 143051334313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 293227665025 + 20205485316 = 541505^2 + 142146^2 .
It is a cyclic number.
It is not a de Polignac number, because 313433150341 - 21 = 313433150339 is a prime.
Together with 313433150339, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313433150311) 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, 156716575170 + 156716575171.
It is an arithmetic number, because the mean of its divisors is an integer number (156716575171).
Almost surely, 2313433150341 is an apocalyptic number.
It is an amenable number.
313433150341 is a deficient number, since it is larger than the sum of its proper divisors (1).
313433150341 is an equidigital number, since it uses as much as digits as its factorization.
313433150341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 313433150341 its reverse (143051334313), we get a palindrome (456484484654).
The spelling of 313433150341 in words is "three hundred thirteen billion, four hundred thirty-three million, one hundred fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •