Base | Representation |
---|---|
bin | 100111001001000… |
… | …1000100011100001 |
3 | 10101112100102211101 |
4 | 1032102020203201 |
5 | 10142211021411 |
6 | 334154114401 |
7 | 44355341644 |
oct | 11622104341 |
9 | 3345312741 |
10 | 1313376481 |
11 | 61440420a |
12 | 307a1ba01 |
13 | 17c13c661 |
14 | c6603a5b |
15 | 7a4838c1 |
hex | 4e4888e1 |
1313376481 has 2 divisors, whose sum is σ = 1313376482. Its totient is φ = 1313376480.
The previous prime is 1313376437. The next prime is 1313376511. The reversal of 1313376481 is 1846733131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1148125456 + 165251025 = 33884^2 + 12855^2 .
It is an emirp because it is prime and its reverse (1846733131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1313376481 - 27 = 1313376353 is a prime.
It is a super-2 number, since 2×13133764812 = 3449915561687886722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1313376481.
It is not a weakly prime, because it can be changed into another prime (1313376401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656688240 + 656688241.
It is an arithmetic number, because the mean of its divisors is an integer number (656688241).
Almost surely, 21313376481 is an apocalyptic number.
It is an amenable number.
1313376481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313376481 is an equidigital number, since it uses as much as digits as its factorization.
1313376481 is an evil number, because the sum of its binary digits is even.
The product of its digits is 36288, while the sum is 37.
The square root of 1313376481 is about 36240.5364336678. The cubic root of 1313376481 is about 1095.1234491735.
The spelling of 1313376481 in words is "one billion, three hundred thirteen million, three hundred seventy-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •