Base | Representation |
---|---|
bin | 100110111000000… |
… | …0010111000000001 |
3 | 10100220112102201111 |
4 | 1031300002320001 |
5 | 10132414042241 |
6 | 333234403321 |
7 | 44216363002 |
oct | 11560027001 |
9 | 3326472644 |
10 | 1304440321 |
11 | 60a360358 |
12 | 304a30541 |
13 | 17a3310a2 |
14 | c53591a9 |
15 | 797bac81 |
hex | 4dc02e01 |
1304440321 has 2 divisors, whose sum is σ = 1304440322. Its totient is φ = 1304440320.
The previous prime is 1304440283. The next prime is 1304440339. The reversal of 1304440321 is 1230444031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 779526400 + 524913921 = 27920^2 + 22911^2 .
It is a cyclic number.
It is not a de Polignac number, because 1304440321 - 227 = 1170222593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1304440292 and 1304440301.
It is not a weakly prime, because it can be changed into another prime (1304440121) 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 as a sum of consecutive naturals, namely, 652220160 + 652220161.
It is an arithmetic number, because the mean of its divisors is an integer number (652220161).
Almost surely, 21304440321 is an apocalyptic number.
It is an amenable number.
1304440321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304440321 is an equidigital number, since it uses as much as digits as its factorization.
1304440321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1304440321 is about 36117.0364371165. The cubic root of 1304440321 is about 1092.6340696373.
Adding to 1304440321 its reverse (1230444031), we get a palindrome (2534884352).
The spelling of 1304440321 in words is "one billion, three hundred four million, four hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •