Base | Representation |
---|---|
bin | 100111101001100… |
… | …0100111111000101 |
3 | 10102201101101101022 |
4 | 1033103010333011 |
5 | 10211040314341 |
6 | 340003040525 |
7 | 44653136522 |
oct | 11723047705 |
9 | 3381341338 |
10 | 1330401221 |
11 | 622a82146 |
12 | 311670145 |
13 | 182820776 |
14 | c8996149 |
15 | 7bbe7e4b |
hex | 4f4c4fc5 |
1330401221 has 2 divisors, whose sum is σ = 1330401222. Its totient is φ = 1330401220.
The previous prime is 1330401197. The next prime is 1330401229. The reversal of 1330401221 is 1221040331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1318053025 + 12348196 = 36305^2 + 3514^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330401221 - 26 = 1330401157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1330401221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330401229) 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 as a sum of consecutive naturals, namely, 665200610 + 665200611.
It is an arithmetic number, because the mean of its divisors is an integer number (665200611).
Almost surely, 21330401221 is an apocalyptic number.
It is an amenable number.
1330401221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330401221 is an equidigital number, since it uses as much as digits as its factorization.
1330401221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1330401221 is about 36474.6654679656. The cubic root of 1330401221 is about 1099.8350223654.
Adding to 1330401221 its reverse (1221040331), we get a palindrome (2551441552).
The spelling of 1330401221 in words is "one billion, three hundred thirty million, four hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •