Base | Representation |
---|---|
bin | 10011000101100011010… |
… | …001010010111001001101 |
3 | 11122101112210012020200002 |
4 | 103011203101102321031 |
5 | 132442204402103001 |
6 | 2442315453414045 |
7 | 163522266220013 |
oct | 23054321227115 |
9 | 4571483166602 |
10 | 1311630503501 |
11 | 46629425265a |
12 | 19225249a325 |
13 | 968bc83a886 |
14 | 476aa0a28b3 |
15 | 241ba00a46b |
hex | 13163452e4d |
1311630503501 has 8 divisors (see below), whose sum is σ = 1319129846784. Its totient is φ = 1304137745680.
The previous prime is 1311630503471. The next prime is 1311630503539. The reversal of 1311630503501 is 1053050361131.
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 1311630503501 - 210 = 1311630502477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311630503591) 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 7 ways as a sum of consecutive naturals, for example, 1246610 + ... + 2043843.
It is an arithmetic number, because the mean of its divisors is an integer number (164891230848).
Almost surely, 21311630503501 is an apocalyptic number.
It is an amenable number.
1311630503501 is a deficient number, since it is larger than the sum of its proper divisors (7499343283).
1311630503501 is a wasteful number, since it uses less digits than its factorization.
1311630503501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3292731.
The product of its (nonzero) digits is 4050, while the sum is 29.
Adding to 1311630503501 its reverse (1053050361131), we get a palindrome (2364680864632).
The spelling of 1311630503501 in words is "one trillion, three hundred eleven billion, six hundred thirty million, five hundred three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •