Base | Representation |
---|---|
bin | 100110110010000… |
… | …0101100001010000 |
3 | 10100200122011110012 |
4 | 1031210011201100 |
5 | 10131113233144 |
6 | 333043254052 |
7 | 44150625236 |
oct | 11544054120 |
9 | 3320564405 |
10 | 1301305424 |
11 | 60860a031 |
12 | 30397a328 |
13 | 1797a4213 |
14 | c4b80956 |
15 | 7939be9e |
hex | 4d905850 |
1301305424 has 10 divisors (see below), whose sum is σ = 2521279290. Its totient is φ = 650652704.
The previous prime is 1301305393. The next prime is 1301305427. The reversal of 1301305424 is 4245031031.
It can be written as a sum of positive squares in only one way, i.e., 1250895424 + 50410000 = 35368^2 + 7100^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1301305424.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301305427) 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, 40665779 + ... + 40665810.
It is an arithmetic number, because the mean of its divisors is an integer number (252127929).
Almost surely, 21301305424 is an apocalyptic number.
It is an amenable number.
1301305424 is a deficient number, since it is larger than the sum of its proper divisors (1219973866).
1301305424 is an equidigital number, since it uses as much as digits as its factorization.
1301305424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81331597 (or 81331591 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 1301305424 is about 36073.6111860180. The cubic root of 1301305424 is about 1091.7580763527.
Adding to 1301305424 its reverse (4245031031), we get a palindrome (5546336455).
The spelling of 1301305424 in words is "one billion, three hundred one million, three hundred five thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •