Base | Representation |
---|---|
bin | 100110110111100… |
… | …1010111101100101 |
3 | 10100220002210120021 |
4 | 1031233022331211 |
5 | 10132334230201 |
6 | 333225435141 |
7 | 44214420211 |
oct | 11557127545 |
9 | 3326083507 |
10 | 1304211301 |
11 | 60a214288 |
12 | 30493bab1 |
13 | 17a280a83 |
14 | c52d9941 |
15 | 79772ea1 |
hex | 4dbcaf65 |
1304211301 has 2 divisors, whose sum is σ = 1304211302. Its totient is φ = 1304211300.
The previous prime is 1304211277. The next prime is 1304211329. The reversal of 1304211301 is 1031124031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 662805025 + 641406276 = 25745^2 + 25326^2 .
It is a cyclic number.
It is not a de Polignac number, because 1304211301 - 27 = 1304211173 is a prime.
It is a super-2 number, since 2×13042113012 = 3401934235312225202, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1304211331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 652105650 + 652105651.
It is an arithmetic number, because the mean of its divisors is an integer number (652105651).
Almost surely, 21304211301 is an apocalyptic number.
It is an amenable number.
1304211301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304211301 is an equidigital number, since it uses as much as digits as its factorization.
1304211301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1304211301 is about 36113.8657720272. The cubic root of 1304211301 is about 1092.5701214708.
Adding to 1304211301 its reverse (1031124031), we get a palindrome (2335335332).
The spelling of 1304211301 in words is "one billion, three hundred four million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •