Base | Representation |
---|---|
bin | 10011000100111111100… |
… | …010011010010000010101 |
3 | 11122100000000010211122010 |
4 | 103010333202122100111 |
5 | 132434442414312300 |
6 | 2442140200254433 |
7 | 163501366501341 |
oct | 23047742322025 |
9 | 4570000124563 |
10 | 1311031010325 |
11 | 466006910553 |
12 | 192105771419 |
13 | 9682558b89a |
14 | 4765060c621 |
15 | 2418258ca50 |
hex | 1313f89a415 |
1311031010325 has 48 divisors (see below), whose sum is σ = 2261985509376. Its totient is φ = 668764958400.
The previous prime is 1311031010323. The next prime is 1311031010329. The reversal of 1311031010325 is 5230101301131.
It is not a de Polignac number, because 1311031010325 - 21 = 1311031010323 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311031010323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 34879692 + ... + 34917258.
It is an arithmetic number, because the mean of its divisors is an integer number (47124698112).
Almost surely, 21311031010325 is an apocalyptic number.
1311031010325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1311031010325 is a deficient number, since it is larger than the sum of its proper divisors (950954499051).
1311031010325 is a wasteful number, since it uses less digits than its factorization.
1311031010325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57834 (or 57829 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 1311031010325 its reverse (5230101301131), we get a palindrome (6541132311456).
The spelling of 1311031010325 in words is "one trillion, three hundred eleven billion, thirty-one million, ten thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •