Base | Representation |
---|---|
bin | 10011010010110001101… |
… | …101000101101000111101 |
3 | 11200202012110112011102210 |
4 | 103102301231011220331 |
5 | 133210300304021411 |
6 | 2453024542211033 |
7 | 164534223136566 |
oct | 23226155055075 |
9 | 4622173464383 |
10 | 1325831313981 |
11 | 471311237769 |
12 | 194b56283a79 |
13 | 98043928905 |
14 | 482560cd16d |
15 | 2474baa7ca6 |
hex | 134b1b45a3d |
1325831313981 has 8 divisors (see below), whose sum is σ = 1871761855104. Its totient is φ = 831894157760.
The previous prime is 1325831313967. The next prime is 1325831313991. The reversal of 1325831313981 is 1893131385231.
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 1325831313981 - 27 = 1325831313853 is a prime.
It is a super-2 number, since 2×13258313139812 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1325831313981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1325831313941) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12998346165 + ... + 12998346266.
It is an arithmetic number, because the mean of its divisors is an integer number (233970231888).
Almost surely, 21325831313981 is an apocalyptic number.
It is an amenable number.
1325831313981 is a deficient number, since it is larger than the sum of its proper divisors (545930541123).
1325831313981 is a wasteful number, since it uses less digits than its factorization.
1325831313981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25996692451.
The product of its digits is 466560, while the sum is 48.
The spelling of 1325831313981 in words is "one trillion, three hundred twenty-five billion, eight hundred thirty-one million, three hundred thirteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •