Base | Representation |
---|---|
bin | 1010000010111100001110… |
… | …0100111000001000000101 |
3 | 1110002221201210101201220000 |
4 | 2200233003210320020011 |
5 | 2421432433342022323 |
6 | 35254144205031513 |
7 | 2220010211040330 |
oct | 240570344701005 |
9 | 43087653351800 |
10 | 11045642142213 |
11 | 35794810369a8 |
12 | 12a4877255599 |
13 | 6217a43976b3 |
14 | 2a287d1db617 |
15 | 1424c868be43 |
hex | a0bc3938205 |
11045642142213 has 40 divisors (see below), whose sum is σ = 19677352852608. Its totient is φ = 6037369610976.
The previous prime is 11045642142209. The next prime is 11045642142299. The reversal of 11045642142213 is 31224124654011.
11045642142213 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 5 + 6 + 421 + 4 + 221 + 3 = 666.
It is not a de Polignac number, because 11045642142213 - 22 = 11045642142209 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11045642142013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 423483706 + ... + 423509787.
Almost surely, 211045642142213 is an apocalyptic number.
It is an amenable number.
11045642142213 is a deficient number, since it is larger than the sum of its proper divisors (8631710710395).
11045642142213 is an equidigital number, since it uses as much as digits as its factorization.
11045642142213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 846993535 (or 846993526 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
Adding to 11045642142213 its reverse (31224124654011), we get a palindrome (42269766796224).
The spelling of 11045642142213 in words is "eleven trillion, forty-five billion, six hundred forty-two million, one hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •