Base | Representation |
---|---|
bin | 100101000111000100000110… |
… | …1100101101011010011101001 |
3 | 1120210210001102100121002122120 |
4 | 1022032020031211223103221 |
5 | 320241132112044123423 |
6 | 3114130104212341453 |
7 | 125520344550646104 |
oct | 11216101545532351 |
9 | 1523701370532576 |
10 | 326426332411113 |
11 | 950116a2802540 |
12 | 3073b73a314889 |
13 | 1101ab4296570c |
14 | 5a87193d4973b |
15 | 27b1170bdbee3 |
hex | 128e20d96b4e9 |
326426332411113 has 32 divisors (see below), whose sum is σ = 480751468963200. Its totient is φ = 195370519319040.
The previous prime is 326426332411093. The next prime is 326426332411121. The reversal of 326426332411113 is 311114233624623.
It is not a de Polignac number, because 326426332411113 - 212 = 326426332407017 is a prime.
It is not an unprimeable number, because it can be changed into a prime (326426332451113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 191020156 + ... + 192721437.
It is an arithmetic number, because the mean of its divisors is an integer number (15023483405100).
Almost surely, 2326426332411113 is an apocalyptic number.
326426332411113 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
326426332411113 is a deficient number, since it is larger than the sum of its proper divisors (154325136552087).
326426332411113 is a wasteful number, since it uses less digits than its factorization.
326426332411113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383741929.
The product of its digits is 373248, while the sum is 42.
The spelling of 326426332411113 in words is "three hundred twenty-six trillion, four hundred twenty-six billion, three hundred thirty-two million, four hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •