Base | Representation |
---|---|
bin | 100110111100000… |
… | …1010011010000001 |
3 | 10101001112112210022 |
4 | 1031320022122001 |
5 | 10133440141241 |
6 | 333352143225 |
7 | 44243435042 |
oct | 11570123201 |
9 | 3331475708 |
10 | 1306568321 |
11 | 610584133 |
12 | 305697b15 |
13 | 17a8c7866 |
14 | c57508c9 |
15 | 79a8b54b |
hex | 4de0a681 |
1306568321 has 4 divisors (see below), whose sum is σ = 1322310192. Its totient is φ = 1290826452.
The previous prime is 1306568317. The next prime is 1306568323. The reversal of 1306568321 is 1238656031.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1238656031 = 12413 ⋅99787.
It is a cyclic number.
It is not a de Polignac number, because 1306568321 - 22 = 1306568317 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1306568323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7870811 + ... + 7870976.
It is an arithmetic number, because the mean of its divisors is an integer number (330577548).
Almost surely, 21306568321 is an apocalyptic number.
It is an amenable number.
1306568321 is a deficient number, since it is larger than the sum of its proper divisors (15741871).
1306568321 is an equidigital number, since it uses as much as digits as its factorization.
1306568321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15741870.
The product of its (nonzero) digits is 25920, while the sum is 35.
The square root of 1306568321 is about 36146.4842135442. The cubic root of 1306568321 is about 1093.2279033917.
The spelling of 1306568321 in words is "one billion, three hundred six million, five hundred sixty-eight thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •