Base | Representation |
---|---|
bin | 1010000000111111110111… |
… | …1110101101011000111111 |
3 | 1102222202120111020201201021 |
4 | 2200033331332231120333 |
5 | 2420411103114113033 |
6 | 35230544034125011 |
7 | 2214416060500363 |
oct | 240177576553077 |
9 | 42882514221637 |
10 | 11012262254143 |
11 | 3566301a53a47 |
12 | 129a300420767 |
13 | 61b5b49cbb37 |
14 | 2a0dd3d3d2a3 |
15 | 1416c2e7eb2d |
hex | a03fdfad63f |
11012262254143 has 8 divisors (see below), whose sum is σ = 11163194031600. Its totient is φ = 10861332608448.
The previous prime is 11012262253987. The next prime is 11012262254207. The reversal of 11012262254143 is 34145226221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11012262254143 - 221 = 11012260156991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012262254099 and 11012262254108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012262254243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11817228 + ... + 12715006.
It is an arithmetic number, because the mean of its divisors is an integer number (1395399253950).
Almost surely, 211012262254143 is an apocalyptic number.
11012262254143 is a deficient number, since it is larger than the sum of its proper divisors (150931777457).
11012262254143 is an equidigital number, since it uses as much as digits as its factorization.
11012262254143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1065881.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 11012262254143 its reverse (34145226221011), we get a palindrome (45157488475154).
The spelling of 11012262254143 in words is "eleven trillion, twelve billion, two hundred sixty-two million, two hundred fifty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •