Base | Representation |
---|---|
bin | 100110110001101… |
… | …1010111101110001 |
3 | 10100200022022100112 |
4 | 1031203122331301 |
5 | 10131042143441 |
6 | 333035431105 |
7 | 44146301123 |
oct | 11543327561 |
9 | 3320268315 |
10 | 1301131121 |
11 | 608500084 |
12 | 3038b5495 |
13 | 179742a94 |
14 | c4b37213 |
15 | 793654eb |
hex | 4d8daf71 |
1301131121 has 2 divisors, whose sum is σ = 1301131122. Its totient is φ = 1301131120.
The previous prime is 1301131093. The next prime is 1301131133. The reversal of 1301131121 is 1211311031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1162810000 + 138321121 = 34100^2 + 11761^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301131121 - 210 = 1301130097 is a prime.
It is a super-5 number, since 5×13011311215 (a number of 47 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1301131096 and 1301131105.
It is not a weakly prime, because it can be changed into another prime (1301131141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650565560 + 650565561.
It is an arithmetic number, because the mean of its divisors is an integer number (650565561).
Almost surely, 21301131121 is an apocalyptic number.
It is an amenable number.
1301131121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301131121 is an equidigital number, since it uses as much as digits as its factorization.
1301131121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1301131121 is about 36071.1951701077. The cubic root of 1301131121 is about 1091.7093290969.
Adding to 1301131121 its reverse (1211311031), we get a palindrome (2512442152).
The spelling of 1301131121 in words is "one billion, three hundred one million, one hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •