Base | Representation |
---|---|
bin | 1010000010110100000000… |
… | …1001011000000000011111 |
3 | 1110002202001010020212120222 |
4 | 2200231000021120000133 |
5 | 2421413424400224341 |
6 | 35253141315431555 |
7 | 2216601444452633 |
oct | 240550011300037 |
9 | 43082033225528 |
10 | 11043437117471 |
11 | 357854a395200 |
12 | 12a43608b55bb |
13 | 6215125c6c25 |
14 | 2a2710412dc3 |
15 | 1423e9ccb44b |
hex | a0b4025801f |
11043437117471 has 6 divisors (see below), whose sum is σ = 12138654021816. Its totient is φ = 10039488288500.
The previous prime is 11043437117389. The next prime is 11043437117477. The reversal of 11043437117471 is 17471173434011.
It is not a de Polignac number, because 11043437117471 - 214 = 11043437101087 is a prime.
It is a super-3 number, since 3×110434371174713 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11043437117477) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 45634037555 + ... + 45634037796.
It is an arithmetic number, because the mean of its divisors is an integer number (2023109003636).
Almost surely, 211043437117471 is an apocalyptic number.
11043437117471 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11043437117471 is a deficient number, since it is larger than the sum of its proper divisors (1095216904345).
11043437117471 is an equidigital number, since it uses as much as digits as its factorization.
11043437117471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91268075373 (or 91268075362 counting only the distinct ones).
The product of its (nonzero) digits is 197568, while the sum is 44.
The spelling of 11043437117471 in words is "eleven trillion, forty-three billion, four hundred thirty-seven million, one hundred seventeen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •