Base | Representation |
---|---|
bin | 100110110010010… |
… | …0100000000101001 |
3 | 10100200212111202201 |
4 | 1031210210000221 |
5 | 10131131232223 |
6 | 333050100201 |
7 | 44151655321 |
oct | 11544440051 |
9 | 3320774681 |
10 | 1301430313 |
11 | 608694947 |
12 | 303a1a661 |
13 | 179819011 |
14 | c4bb4281 |
15 | 793c3ead |
hex | 4d924029 |
1301430313 has 4 divisors (see below), whose sum is σ = 1343411968. Its totient is φ = 1259448660.
The previous prime is 1301430293. The next prime is 1301430331. The reversal of 1301430313 is 3130341031.
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 1301430313 - 25 = 1301430281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1301430343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20990781 + ... + 20990842.
It is an arithmetic number, because the mean of its divisors is an integer number (335852992).
Almost surely, 21301430313 is an apocalyptic number.
It is an amenable number.
1301430313 is a deficient number, since it is larger than the sum of its proper divisors (41981655).
1301430313 is an equidigital number, since it uses as much as digits as its factorization.
1301430313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41981654.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 1301430313 is about 36075.3421743994. The cubic root of 1301430313 is about 1091.7930013365.
Adding to 1301430313 its reverse (3130341031), we get a palindrome (4431771344).
The spelling of 1301430313 in words is "one billion, three hundred one million, four hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •