Base | Representation |
---|---|
bin | 100111001011001… |
… | …1101011011001101 |
3 | 10101121111001110121 |
4 | 1032112131123031 |
5 | 10143003314131 |
6 | 334234304541 |
7 | 44401104151 |
oct | 11626353315 |
9 | 3347431417 |
10 | 1314510541 |
11 | 615009253 |
12 | 308288151 |
13 | 17c4488b6 |
14 | c681b061 |
15 | 7a609911 |
hex | 4e59d6cd |
1314510541 has 2 divisors, whose sum is σ = 1314510542. Its totient is φ = 1314510540.
The previous prime is 1314510529. The next prime is 1314510551. The reversal of 1314510541 is 1450154131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1207284516 + 107226025 = 34746^2 + 10355^2 .
It is an emirp because it is prime and its reverse (1450154131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1314510541 - 223 = 1306121933 is a prime.
It is a super-2 number, since 2×13145105412 = 3455875924800225362, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1314510511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657255270 + 657255271.
It is an arithmetic number, because the mean of its divisors is an integer number (657255271).
Almost surely, 21314510541 is an apocalyptic number.
It is an amenable number.
1314510541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314510541 is an equidigital number, since it uses as much as digits as its factorization.
1314510541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1200, while the sum is 25.
The square root of 1314510541 is about 36256.1793491813. The cubic root of 1314510541 is about 1095.4385602454.
Adding to 1314510541 its reverse (1450154131), we get a palindrome (2764664672).
The spelling of 1314510541 in words is "one billion, three hundred fourteen million, five hundred ten thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •