Base | Representation |
---|---|
bin | 1011111100111110010011… |
… | …0101001011011101110111 |
3 | 1201112101011121201012012110 |
4 | 2333033210311023131313 |
5 | 3210310102342314221 |
6 | 43541230114022103 |
7 | 2524326403505565 |
oct | 277174465133567 |
9 | 51471147635173 |
10 | 13142144104311 |
11 | 4207608806172 |
12 | 1583051577933 |
13 | 7443b680ac91 |
14 | 336124300a35 |
15 | 17bccd733776 |
hex | bf3e4d4b777 |
13142144104311 has 8 divisors (see below), whose sum is σ = 17525535303424. Its totient is φ = 8760091154040.
The previous prime is 13142144104261. The next prime is 13142144104333. The reversal of 13142144104311 is 11340144124131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13142144104311 - 29 = 13142144103799 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 (13142144104351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 334539295 + ... + 334578576.
It is an arithmetic number, because the mean of its divisors is an integer number (2190691912928).
Almost surely, 213142144104311 is an apocalyptic number.
13142144104311 is a deficient number, since it is larger than the sum of its proper divisors (4383391199113).
13142144104311 is an equidigital number, since it uses as much as digits as its factorization.
13142144104311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669124421.
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 13142144104311 its reverse (11340144124131), we get a palindrome (24482288228442).
The spelling of 13142144104311 in words is "thirteen trillion, one hundred forty-two billion, one hundred forty-four million, one hundred four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •