Base | Representation |
---|---|
bin | 1010011111110110000110… |
… | …0101000100010010110111 |
3 | 1111212102110202101112021020 |
4 | 2213331201211010102313 |
5 | 3003101423320344343 |
6 | 40314230420152223 |
7 | 2300616554124264 |
oct | 247754145042267 |
9 | 44772422345236 |
10 | 11542214231223 |
11 | 3750031035105 |
12 | 1364b60238673 |
13 | 659570299470 |
14 | 2bc90906a26b |
15 | 15038d3a2b83 |
hex | a7f619444b7 |
11542214231223 has 16 divisors (see below), whose sum is σ = 17021366519136. Its totient is φ = 6910930765440.
The previous prime is 11542214231221. The next prime is 11542214231231. The reversal of 11542214231223 is 32213241224511.
It is not a de Polignac number, because 11542214231223 - 21 = 11542214231221 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11542214231221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3999379788 + ... + 3999382673.
It is an arithmetic number, because the mean of its divisors is an integer number (1063835407446).
Almost surely, 211542214231223 is an apocalyptic number.
11542214231223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11542214231223 is a deficient number, since it is larger than the sum of its proper divisors (5479152287913).
11542214231223 is a wasteful number, since it uses less digits than its factorization.
11542214231223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7998762514.
The product of its digits is 23040, while the sum is 33.
Adding to 11542214231223 its reverse (32213241224511), we get a palindrome (43755455455734).
The spelling of 11542214231223 in words is "eleven trillion, five hundred forty-two billion, two hundred fourteen million, two hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •