Base | Representation |
---|---|
bin | 10011010010010011100… |
… | …110010111011001011111 |
3 | 11200200220021010111122102 |
4 | 103102103212113121133 |
5 | 133203232004011411 |
6 | 2452502500435315 |
7 | 164515551061025 |
oct | 23222346273137 |
9 | 4620807114572 |
10 | 1325326235231 |
11 | 471082121609 |
12 | 194a350a8b3b |
13 | 97c930b5c4b |
14 | 48208db4715 |
15 | 2471c589d3b |
hex | 1349399765f |
1325326235231 has 4 divisors (see below), whose sum is σ = 1368078694464. Its totient is φ = 1282573776000.
The previous prime is 1325326235171. The next prime is 1325326235257.
1325326235231 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1325326235231 - 210 = 1325326234207 is a prime.
It is a super-2 number, since 2×13253262352312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1325326235291) 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 3 ways as a sum of consecutive naturals, for example, 21376229570 + ... + 21376229631.
It is an arithmetic number, because the mean of its divisors is an integer number (342019673616).
Almost surely, 21325326235231 is an apocalyptic number.
1325326235231 is a deficient number, since it is larger than the sum of its proper divisors (42752459233).
1325326235231 is an equidigital number, since it uses as much as digits as its factorization.
1325326235231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42752459232.
The product of its digits is 194400, while the sum is 38.
The spelling of 1325326235231 in words is "one trillion, three hundred twenty-five billion, three hundred twenty-six million, two hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •