Base | Representation |
---|---|
bin | 1010001000100000000001… |
… | …1100101001010111111011 |
3 | 1110110002021002022112100020 |
4 | 2202020000130221113323 |
5 | 2430014040041102243 |
6 | 35410101435141523 |
7 | 2226631102135146 |
oct | 242100034512773 |
9 | 43402232275306 |
10 | 11141152675323 |
11 | 3605a33266090 |
12 | 12bb2915a48a3 |
13 | 62a7b5a4aa48 |
14 | 2a733dcd505d |
15 | 144c186b9283 |
hex | a22007295fb |
11141152675323 has 16 divisors (see below), whose sum is σ = 16207113804672. Its totient is φ = 6751463400000.
The previous prime is 11141152675313. The next prime is 11141152675333. The reversal of 11141152675323 is 32357625114111.
It is an interprime number because it is at equal distance from previous prime (11141152675313) and next prime (11141152675333).
It is not a de Polignac number, because 11141152675323 - 25 = 11141152675291 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11141152675313) 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 15 ways as a sum of consecutive naturals, for example, 18457033 + ... + 19051098.
It is an arithmetic number, because the mean of its divisors is an integer number (1012944612792).
Almost surely, 211141152675323 is an apocalyptic number.
11141152675323 is a deficient number, since it is larger than the sum of its proper divisors (5065961129349).
11141152675323 is a wasteful number, since it uses less digits than its factorization.
11141152675323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37517146.
The product of its digits is 151200, while the sum is 42.
Adding to 11141152675323 its reverse (32357625114111), we get a palindrome (43498777789434).
The spelling of 11141152675323 in words is "eleven trillion, one hundred forty-one billion, one hundred fifty-two million, six hundred seventy-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •