Base | Representation |
---|---|
bin | 10011000101000011110… |
… | …101011011110110000011 |
3 | 11122100012000210200220102 |
4 | 103011003311123312003 |
5 | 132440114343401220 |
6 | 2442151253433015 |
7 | 163503233345153 |
oct | 23050365336603 |
9 | 4570160720812 |
10 | 1311103106435 |
11 | 466043583411 |
12 | 19212593b76b |
13 | 968374b24c5 |
14 | 4765a018763 |
15 | 24188a7e775 |
hex | 13143d5bd83 |
1311103106435 has 16 divisors (see below), whose sum is σ = 1584097627392. Its totient is φ = 1041710623200.
The previous prime is 1311103106413. The next prime is 1311103106437. The reversal of 1311103106435 is 5346013011131.
It is a happy number.
It is not a de Polignac number, because 1311103106435 - 26 = 1311103106371 is a prime.
It is a super-3 number, since 3×13111031064353 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1311103106398 and 1311103106407.
It is not an unprimeable number, because it can be changed into a prime (1311103106437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 307340 + ... + 1648230.
It is an arithmetic number, because the mean of its divisors is an integer number (99006101712).
Almost surely, 21311103106435 is an apocalyptic number.
1311103106435 is a deficient number, since it is larger than the sum of its proper divisors (272994520957).
1311103106435 is a wasteful number, since it uses less digits than its factorization.
1311103106435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1342234.
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 1311103106435 its reverse (5346013011131), we get a palindrome (6657116117566).
The spelling of 1311103106435 in words is "one trillion, three hundred eleven billion, one hundred three million, one hundred six thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •