Base | Representation |
---|---|
bin | 1010000011001100100111… |
… | …1101000011100111110001 |
3 | 1110010101002120110221022210 |
4 | 2200303021331003213301 |
5 | 2422020442243030340 |
6 | 35300153054322333 |
7 | 2220224252126511 |
oct | 240631175034761 |
9 | 43111076427283 |
10 | 11050044111345 |
11 | 358032a910518 |
12 | 12a56a54b93a9 |
13 | 622026369a65 |
14 | 2a2b79aa9841 |
15 | 142684d64180 |
hex | a0cc9f439f1 |
11050044111345 has 32 divisors (see below), whose sum is σ = 18720353467008. Its totient is φ = 5546606220288.
The previous prime is 11050044111341. The next prime is 11050044111397. The reversal of 11050044111345 is 54311144005011.
11050044111345 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11050044111345 - 22 = 11050044111341 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11050044111341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19132947 + ... + 19702023.
It is an arithmetic number, because the mean of its divisors is an integer number (585011045844).
Almost surely, 211050044111345 is an apocalyptic number.
11050044111345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11050044111345 is a deficient number, since it is larger than the sum of its proper divisors (7670309355663).
11050044111345 is a wasteful number, since it uses less digits than its factorization.
11050044111345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645249.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 11050044111345 its reverse (54311144005011), we get a palindrome (65361188116356).
The spelling of 11050044111345 in words is "eleven trillion, fifty billion, forty-four million, one hundred eleven thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •