Base | Representation |
---|---|
bin | 10011000101001011011… |
… | …111011010001111011001 |
3 | 11122100111222111022221020 |
4 | 103011023133122033121 |
5 | 132440400234103200 |
6 | 2442212122433053 |
7 | 163506353165346 |
oct | 23051337321731 |
9 | 4570458438836 |
10 | 1311231550425 |
11 | 4660aa032275 |
12 | 192160962789 |
13 | 96857ca4974 |
14 | 4766d0d17cd |
15 | 24194ea1ea0 |
hex | 1314b7da3d9 |
1311231550425 has 48 divisors (see below), whose sum is σ = 2176197476352. Its totient is φ = 696651624000.
The previous prime is 1311231550423. The next prime is 1311231550459. The reversal of 1311231550425 is 5240551321131.
It is not a de Polignac number, because 1311231550425 - 21 = 1311231550423 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1311231550423) 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 47 ways as a sum of consecutive naturals, for example, 28266000 + ... + 28312350.
It is an arithmetic number, because the mean of its divisors is an integer number (45337447424).
Almost surely, 21311231550425 is an apocalyptic number.
1311231550425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1311231550425 is a deficient number, since it is larger than the sum of its proper divisors (864965925927).
1311231550425 is a wasteful number, since it uses less digits than its factorization.
1311231550425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47798 (or 47793 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 1311231550425 its reverse (5240551321131), we get a palindrome (6551782871556).
The spelling of 1311231550425 in words is "one trillion, three hundred eleven billion, two hundred thirty-one million, five hundred fifty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •