Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0011111100100011011111 |
3 | 1111010020112222112202002000 |
4 | 2210320322103330203133 |
5 | 2441122044110043033 |
6 | 40033234133133343 |
7 | 2246434162062243 |
oct | 244707223744337 |
9 | 44106488482060 |
10 | 11331102034143 |
11 | 3679547773861 |
12 | 133006318a253 |
13 | 642697a2b558 |
14 | 2b25dd230423 |
15 | 149b345caa13 |
hex | a4e3a4fc8df |
11331102034143 has 16 divisors (see below), whose sum is σ = 16809411152640. Its totient is φ = 7543901026872.
The previous prime is 11331102034069. The next prime is 11331102034199. The reversal of 11331102034143 is 34143020113311.
11331102034143 is a `hidden beast` number, since 1 + 1 + 3 + 31 + 10 + 203 + 414 + 3 = 666.
It is not a de Polignac number, because 11331102034143 - 224 = 11331085256927 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331102033143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 282396121 + ... + 282436242.
It is an arithmetic number, because the mean of its divisors is an integer number (1050588197040).
Almost surely, 211331102034143 is an apocalyptic number.
11331102034143 is a deficient number, since it is larger than the sum of its proper divisors (5478309118497).
11331102034143 is an equidigital number, since it uses as much as digits as its factorization.
11331102034143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564833115 (or 564833109 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 11331102034143 its reverse (34143020113311), we get a palindrome (45474122147454).
The spelling of 11331102034143 in words is "eleven trillion, three hundred thirty-one billion, one hundred two million, thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •