Base | Representation |
---|---|
bin | 1100001010111000101001… |
… | …0000100010111001101111 |
3 | 1202101020001211202211022122 |
4 | 3002232022100202321233 |
5 | 3223214040014020421 |
6 | 44243113451503155 |
7 | 2550520122306125 |
oct | 302561220427157 |
9 | 52336054684278 |
10 | 13381142720111 |
11 | 4299a02246661 |
12 | 1601431757abb |
13 | 760ab45a947a |
14 | 3439179a1915 |
15 | 18311a7d82ab |
hex | c2b8a422e6f |
13381142720111 has 8 divisors (see below), whose sum is σ = 13423394874240. Its totient is φ = 13338915116032.
The previous prime is 13381142720081. The next prime is 13381142720129. The reversal of 13381142720111 is 11102724118331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13381142720111 - 26 = 13381142720047 is a prime.
It is a super-2 number, since 2×133811427201112 (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 (13381142720131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5045375 + ... + 7226208.
It is an arithmetic number, because the mean of its divisors is an integer number (1677924359280).
Almost surely, 213381142720111 is an apocalyptic number.
13381142720111 is a deficient number, since it is larger than the sum of its proper divisors (42252154129).
13381142720111 is a wasteful number, since it uses less digits than its factorization.
13381142720111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12275025.
The product of its (nonzero) digits is 8064, while the sum is 35.
Adding to 13381142720111 its reverse (11102724118331), we get a palindrome (24483866838442).
The spelling of 13381142720111 in words is "thirteen trillion, three hundred eighty-one billion, one hundred forty-two million, seven hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •