Base | Representation |
---|---|
bin | 10100111100001101… |
… | …11001100110101101 |
3 | 1002000111211101102020 |
4 | 22132012321212231 |
5 | 141011042343113 |
6 | 5055330420353 |
7 | 545413020564 |
oct | 123606714655 |
9 | 32014741366 |
10 | 11242543533 |
11 | 484a1393a1 |
12 | 22191316b9 |
13 | 10a2259130 |
14 | 7891a8bdb |
15 | 45beee023 |
hex | 29e1b99ad |
11242543533 has 16 divisors (see below), whose sum is σ = 16266376896. Its totient is φ = 6865672320.
The previous prime is 11242543489. The next prime is 11242543577. The reversal of 11242543533 is 33534524211.
It is an interprime number because it is at equal distance from previous prime (11242543489) and next prime (11242543577).
It is not a de Polignac number, because 11242543533 - 26 = 11242543469 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11242543494 and 11242543503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11242543583) 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, 1095160 + ... + 1105377.
It is an arithmetic number, because the mean of its divisors is an integer number (1016648556).
Almost surely, 211242543533 is an apocalyptic number.
11242543533 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11242543533 is a deficient number, since it is larger than the sum of its proper divisors (5023833363).
11242543533 is a wasteful number, since it uses less digits than its factorization.
11242543533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200684.
The product of its digits is 43200, while the sum is 33.
The spelling of 11242543533 in words is "eleven billion, two hundred forty-two million, five hundred forty-three thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •