Base | Representation |
---|---|
bin | 100110111011110… |
… | …0100100010111001 |
3 | 10101001020200001121 |
4 | 1031313210202321 |
5 | 10133420210431 |
6 | 333344545241 |
7 | 44242220650 |
oct | 11567444271 |
9 | 3331220047 |
10 | 1306413241 |
11 | 610488671 |
12 | 305622221 |
13 | 17a8720b3 |
14 | c5710197 |
15 | 79a5a611 |
hex | 4dde48b9 |
1306413241 has 4 divisors (see below), whose sum is σ = 1493043712. Its totient is φ = 1119782772.
The previous prime is 1306413239. The next prime is 1306413247. The reversal of 1306413241 is 1423146031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1306413241 - 21 = 1306413239 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1306413247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93315225 + ... + 93315238.
It is an arithmetic number, because the mean of its divisors is an integer number (373260928).
Almost surely, 21306413241 is an apocalyptic number.
It is an amenable number.
1306413241 is a deficient number, since it is larger than the sum of its proper divisors (186630471).
1306413241 is an equidigital number, since it uses as much as digits as its factorization.
1306413241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186630470.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 1306413241 is about 36144.3389896675. The cubic root of 1306413241 is about 1093.1846489905.
Adding to 1306413241 its reverse (1423146031), we get a palindrome (2729559272).
The spelling of 1306413241 in words is "one billion, three hundred six million, four hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •