Base | Representation |
---|---|
bin | 100111001000110… |
… | …0110001000000101 |
3 | 10101112002021101102 |
4 | 1032101212020011 |
5 | 10142142013321 |
6 | 334151105445 |
7 | 44354213546 |
oct | 11621461005 |
9 | 3345067342 |
10 | 1313235461 |
11 | 61431826a |
12 | 307972285 |
13 | 17c0c0405 |
14 | c65a84cd |
15 | 7a456c0b |
hex | 4e466205 |
1313235461 has 2 divisors, whose sum is σ = 1313235462. Its totient is φ = 1313235460.
The previous prime is 1313235401. The next prime is 1313235463. The reversal of 1313235461 is 1645323131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1149549025 + 163686436 = 33905^2 + 12794^2 .
It is an emirp because it is prime and its reverse (1645323131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1313235461 - 218 = 1312973317 is a prime.
Together with 1313235463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313235463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656617730 + 656617731.
It is an arithmetic number, because the mean of its divisors is an integer number (656617731).
Almost surely, 21313235461 is an apocalyptic number.
It is an amenable number.
1313235461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313235461 is an equidigital number, since it uses as much as digits as its factorization.
1313235461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6480, while the sum is 29.
The square root of 1313235461 is about 36238.5907700617. The cubic root of 1313235461 is about 1095.0842525332.
Adding to 1313235461 its reverse (1645323131), we get a palindrome (2958558592).
The spelling of 1313235461 in words is "one billion, three hundred thirteen million, two hundred thirty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •