Base | Representation |
---|---|
bin | 10011010010011010101… |
… | …110000010111011101111 |
3 | 11200201012120220101111201 |
4 | 103102122232002323233 |
5 | 133204003044022241 |
6 | 2452522405030331 |
7 | 164521531315660 |
oct | 23223256027357 |
9 | 4621176811451 |
10 | 1325445689071 |
11 | 47113359aa99 |
12 | 194a690b53a7 |
13 | 97cb1a7b3aa |
14 | 4821abcb367 |
15 | 24727cd3931 |
hex | 1349ab82eef |
1325445689071 has 4 divisors (see below), whose sum is σ = 1514795073232. Its totient is φ = 1136096304912.
The previous prime is 1325445689047. The next prime is 1325445689101. The reversal of 1325445689071 is 1709865445231.
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 1325445689071 - 213 = 1325445680879 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1325445689021) 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, 94674692070 + ... + 94674692083.
It is an arithmetic number, because the mean of its divisors is an integer number (378698768308).
It is a 2-persistent number, because it is pandigital, and so is 2⋅1325445689071 = 2650891378142, but 3⋅1325445689071 = 3976337067213 is not.
Almost surely, 21325445689071 is an apocalyptic number.
1325445689071 is a deficient number, since it is larger than the sum of its proper divisors (189349384161).
1325445689071 is an equidigital number, since it uses as much as digits as its factorization.
1325445689071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189349384160.
The product of its (nonzero) digits is 7257600, while the sum is 55.
The spelling of 1325445689071 in words is "one trillion, three hundred twenty-five billion, four hundred forty-five million, six hundred eighty-nine thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •