Base | Representation |
---|---|
bin | 1011111100111110111001… |
… | …1001010000000100101111 |
3 | 1201112101120210121221121002 |
4 | 2333033232121100010233 |
5 | 3210310414431232221 |
6 | 43541254045030515 |
7 | 2524333362354011 |
oct | 277175631200457 |
9 | 51471523557532 |
10 | 13142304555311 |
11 | 42076903363a8 |
12 | 158309725543b |
13 | 744410b28ab9 |
14 | 33613b74a1b1 |
15 | 17bcdc87980b |
hex | bf3ee65012f |
13142304555311 has 4 divisors (see below), whose sum is σ = 13338458354712. Its totient is φ = 12946150755912.
The previous prime is 13142304555301. The next prime is 13142304555361. The reversal of 13142304555311 is 11355540324131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13142304555311 - 226 = 13142237446447 is a prime.
It is a super-2 number, since 2×131423045553112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13142304555301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98076899600 + ... + 98076899733.
It is an arithmetic number, because the mean of its divisors is an integer number (3334614588678).
Almost surely, 213142304555311 is an apocalyptic number.
13142304555311 is a deficient number, since it is larger than the sum of its proper divisors (196153799401).
13142304555311 is an equidigital number, since it uses as much as digits as its factorization.
13142304555311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196153799400.
The product of its (nonzero) digits is 108000, while the sum is 38.
Adding to 13142304555311 its reverse (11355540324131), we get a palindrome (24497844879442).
The spelling of 13142304555311 in words is "thirteen trillion, one hundred forty-two billion, three hundred four million, five hundred fifty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •