Base | Representation |
---|---|
bin | 11001000000000100… |
… | …00110111000111001 |
3 | 1021122102110202212110 |
4 | 30200002012320321 |
5 | 204442103402210 |
6 | 10055515002533 |
7 | 653421611514 |
oct | 144002067071 |
9 | 37572422773 |
10 | 13422325305 |
11 | 5768609734 |
12 | 2727139449 |
13 | 135ba2bc2c |
14 | 9148a1d7b |
15 | 538575420 |
hex | 320086e39 |
13422325305 has 8 divisors (see below), whose sum is σ = 21475720512. Its totient is φ = 7158573488.
The previous prime is 13422325277. The next prime is 13422325309. The reversal of 13422325305 is 50352322431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13422325305 - 213 = 13422317113 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13422325309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 447410829 + ... + 447410858.
It is an arithmetic number, because the mean of its divisors is an integer number (2684465064).
Almost surely, 213422325305 is an apocalyptic number.
13422325305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13422325305 is a deficient number, since it is larger than the sum of its proper divisors (8053395207).
13422325305 is an equidigital number, since it uses as much as digits as its factorization.
13422325305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 894821695.
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 13422325305 its reverse (50352322431), we get a palindrome (63774647736).
The spelling of 13422325305 in words is "thirteen billion, four hundred twenty-two million, three hundred twenty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •