Base | Representation |
---|---|
bin | 10011000000011001101… |
… | …001010000011011110001 |
3 | 11121212021101010222120120 |
4 | 103000121221100123301 |
5 | 132344343134203401 |
6 | 2440003022200453 |
7 | 163235245255152 |
oct | 23003151203361 |
9 | 4555241128516 |
10 | 1306100303601 |
11 | 463a06631615 |
12 | 19116a423129 |
13 | 9621abb1c42 |
14 | 47303827929 |
15 | 23e94772836 |
hex | 13019a506f1 |
1306100303601 has 4 divisors (see below), whose sum is σ = 1741467071472. Its totient is φ = 870733535732.
The previous prime is 1306100303549. The next prime is 1306100303609. The reversal of 1306100303601 is 1063030016031.
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 1306100303601 - 211 = 1306100301553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1306100303609) 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, 217683383931 + ... + 217683383936.
It is an arithmetic number, because the mean of its divisors is an integer number (435366767868).
Almost surely, 21306100303601 is an apocalyptic number.
It is an amenable number.
1306100303601 is a deficient number, since it is larger than the sum of its proper divisors (435366767871).
1306100303601 is an equidigital number, since it uses as much as digits as its factorization.
1306100303601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435366767870.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 1306100303601 its reverse (1063030016031), we get a palindrome (2369130319632).
The spelling of 1306100303601 in words is "one trillion, three hundred six billion, one hundred million, three hundred three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •