Base | Representation |
---|---|
bin | 1010000110010110000000… |
… | …1100010111010100010011 |
3 | 1110022112122010021210002121 |
4 | 2201211200030113110103 |
5 | 2423412201201023011 |
6 | 35341053300155111 |
7 | 2224150025226253 |
oct | 241454014272423 |
9 | 43275563253077 |
10 | 11104104314131 |
11 | 35a1251446a64 |
12 | 12b4072098a97 |
13 | 62716034952a |
14 | 2a5627741963 |
15 | 143c9adc1e71 |
hex | a1960317513 |
11104104314131 has 16 divisors (see below), whose sum is σ = 11799249004800. Its totient is φ = 10420056101088.
The previous prime is 11104104314071. The next prime is 11104104314179. The reversal of 11104104314131 is 13141340140111.
It is a cyclic number.
It is not a de Polignac number, because 11104104314131 - 215 = 11104104281363 is a prime.
It is a super-2 number, since 2×111041043141312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11104104314096 and 11104104314105.
It is not an unprimeable number, because it can be changed into a prime (11104104315131) 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, 16065826 + ... + 16742728.
It is an arithmetic number, because the mean of its divisors is an integer number (737453062800).
Almost surely, 211104104314131 is an apocalyptic number.
11104104314131 is a deficient number, since it is larger than the sum of its proper divisors (695144690669).
11104104314131 is a wasteful number, since it uses less digits than its factorization.
11104104314131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 685098.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 11104104314131 its reverse (13141340140111), we get a palindrome (24245444454242).
The spelling of 11104104314131 in words is "eleven trillion, one hundred four billion, one hundred four million, three hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •