Base | Representation |
---|---|
bin | 10011000101000100011… |
… | …011100100011100011101 |
3 | 11122100012201121120210111 |
4 | 103011010123210130131 |
5 | 132440124423300013 |
6 | 2442152252010021 |
7 | 163503414332101 |
oct | 23050433443435 |
9 | 4570181546714 |
10 | 1311113103133 |
11 | 466049191049 |
12 | 192129160911 |
13 | 968395a2702 |
14 | 4765b49b901 |
15 | 241898a673d |
hex | 131446e471d |
1311113103133 has 8 divisors (see below), whose sum is σ = 1311632784000. Its totient is φ = 1310593524768.
The previous prime is 1311113103127. The next prime is 1311113103151. The reversal of 1311113103133 is 3313013111131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1311113103133 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 (1311113103173) 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, 33860418 + ... + 33899116.
It is an arithmetic number, because the mean of its divisors is an integer number (163954098000).
Almost surely, 21311113103133 is an apocalyptic number.
It is an amenable number.
1311113103133 is a deficient number, since it is larger than the sum of its proper divisors (519680867).
1311113103133 is an equidigital number, since it uses as much as digits as its factorization.
1311113103133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51251.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 1311113103133 its reverse (3313013111131), we get a palindrome (4624126214264).
The spelling of 1311113103133 in words is "one trillion, three hundred eleven billion, one hundred thirteen million, one hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •