Base | Representation |
---|---|
bin | 100110110001011… |
… | …1101100000110001 |
3 | 10100200002011212101 |
4 | 1031202331200301 |
5 | 10131024313411 |
6 | 333033100401 |
7 | 44145256321 |
oct | 11542754061 |
9 | 3320064771 |
10 | 1301010481 |
11 | 608428481 |
12 | 303857701 |
13 | 1796ccbb4 |
14 | c4b05281 |
15 | 7933e8c1 |
hex | 4d8bd831 |
1301010481 has 2 divisors, whose sum is σ = 1301010482. Its totient is φ = 1301010480.
The previous prime is 1301010467. The next prime is 1301010497. The reversal of 1301010481 is 1840101031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 913550625 + 387459856 = 30225^2 + 19684^2 .
It is an emirp because it is prime and its reverse (1840101031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1301010481 - 27 = 1301010353 is a prime.
It is a super-2 number, since 2×13010104812 = 3385256543343702722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1301010421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650505240 + 650505241.
It is an arithmetic number, because the mean of its divisors is an integer number (650505241).
Almost surely, 21301010481 is an apocalyptic number.
It is an amenable number.
1301010481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301010481 is an equidigital number, since it uses as much as digits as its factorization.
1301010481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
The square root of 1301010481 is about 36069.5228828994. The cubic root of 1301010481 is about 1091.6755872032.
The spelling of 1301010481 in words is "one billion, three hundred one million, ten thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •