Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …1100110111110101111010 |
3 | 1201102100001121020101011212 |
4 | 2332301330230313311322 |
5 | 3204244430033401432 |
6 | 43514445321123122 |
7 | 2522122154033165 |
oct | 276617454676572 |
9 | 51370047211155 |
10 | 13110332325242 |
11 | 41a50738a2769 |
12 | 1578a539294a2 |
13 | 7413b6c90579 |
14 | 3347873d4adc |
15 | 17b06aa262b2 |
hex | bec7cb37d7a |
13110332325242 has 8 divisors (see below), whose sum is σ = 19886459145300. Its totient is φ = 6481512610144.
The previous prime is 13110332325241. The next prime is 13110332325263. The reversal of 13110332325242 is 24252323301131.
It can be written as a sum of positive squares in 2 ways, for example, as 13105333976641 + 4998348601 = 3620129^2 + 70699^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 13110332325199 and 13110332325208.
It is not an unprimeable number, because it can be changed into a prime (13110332325241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36826776017 + ... + 36826776372.
Almost surely, 213110332325242 is an apocalyptic number.
13110332325242 is a deficient number, since it is larger than the sum of its proper divisors (6776126820058).
13110332325242 is an equidigital number, since it uses as much as digits as its factorization.
13110332325242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73653552480.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 13110332325242 its reverse (24252323301131), we get a palindrome (37362655626373).
The spelling of 13110332325242 in words is "thirteen trillion, one hundred ten billion, three hundred thirty-two million, three hundred twenty-five thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •