Base | Representation |
---|---|
bin | 10011000100111110111… |
… | …000110011000101111101 |
3 | 11122022222020121122020120 |
4 | 103010332320303011331 |
5 | 132434432121231023 |
6 | 2442135130405153 |
7 | 163501204666566 |
oct | 23047670630575 |
9 | 4568866548216 |
10 | 1311020102013 |
11 | 46600073aa16 |
12 | 192101b907b9 |
13 | 9682323c76b |
14 | 4764cdad16d |
15 | 241816358e3 |
hex | 1313ee3317d |
1311020102013 has 8 divisors (see below), whose sum is σ = 1752385973376. Its totient is φ = 871833816000.
The previous prime is 1311020101969. The next prime is 1311020102071. The reversal of 1311020102013 is 3102010201131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1311020102013 - 210 = 1311020100989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311020101983 and 1311020102001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311020106013) 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 7 ways as a sum of consecutive naturals, for example, 544894933 + ... + 544897338.
It is an arithmetic number, because the mean of its divisors is an integer number (219048246672).
Almost surely, 21311020102013 is an apocalyptic number.
It is an amenable number.
1311020102013 is a deficient number, since it is larger than the sum of its proper divisors (441365871363).
1311020102013 is a wasteful number, since it uses less digits than its factorization.
1311020102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1089792675.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1311020102013 its reverse (3102010201131), we get a palindrome (4413030303144).
The spelling of 1311020102013 in words is "one trillion, three hundred eleven billion, twenty million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •