Base | Representation |
---|---|
bin | 1010000010110001001010… |
… | …1001000001100010110011 |
3 | 1110002200001220200022202021 |
4 | 2200230102221001202303 |
5 | 2421410343424142011 |
6 | 35252533444132311 |
7 | 2216543514263416 |
oct | 240542251014263 |
9 | 43080056608667 |
10 | 11042673662131 |
11 | 3578198444981 |
12 | 12a4189097097 |
13 | 62142039abc7 |
14 | 2a267ac7bb7d |
15 | 1423a2c72471 |
hex | a0b12a418b3 |
11042673662131 has 4 divisors (see below), whose sum is σ = 11047378680952. Its totient is φ = 11037968643312.
The previous prime is 11042673662081. The next prime is 11042673662173. The reversal of 11042673662131 is 13126637624011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11042673662131 - 27 = 11042673662003 is a prime.
It is a super-2 number, since 2×110426736621312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11042673665131) 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 3 ways as a sum of consecutive naturals, for example, 2352505890 + ... + 2352510583.
It is an arithmetic number, because the mean of its divisors is an integer number (2761844670238).
Almost surely, 211042673662131 is an apocalyptic number.
11042673662131 is a deficient number, since it is larger than the sum of its proper divisors (4705018821).
11042673662131 is an equidigital number, since it uses as much as digits as its factorization.
11042673662131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4705018820.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 11042673662131 in words is "eleven trillion, forty-two billion, six hundred seventy-three million, six hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •