Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0011111100100110010011 |
3 | 1111010020112222112202022200 |
4 | 2210320322103330212103 |
5 | 2441122044110044243 |
6 | 40033234133134243 |
7 | 2246434162062621 |
oct | 244707223744623 |
9 | 44106488482280 |
10 | 11331102034323 |
11 | 3679547773a05 |
12 | 133006318a383 |
13 | 642697a2b666 |
14 | 2b25dd230511 |
15 | 149b345caad3 |
hex | a4e3a4fc993 |
11331102034323 has 12 divisors (see below), whose sum is σ = 16367324400648. Its totient is φ = 7553986322400.
The previous prime is 11331102034321. The next prime is 11331102034381. The reversal of 11331102034323 is 32343020113311.
11331102034323 is a `hidden beast` number, since 1 + 1 + 3 + 311 + 0 + 2 + 0 + 343 + 2 + 3 = 666.
It is not a de Polignac number, because 11331102034323 - 21 = 11331102034321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11331102034321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5923953 + ... + 7599698.
It is an arithmetic number, because the mean of its divisors is an integer number (1363943700054).
Almost surely, 211331102034323 is an apocalyptic number.
11331102034323 is a deficient number, since it is larger than the sum of its proper divisors (5036222366325).
11331102034323 is a wasteful number, since it uses less digits than its factorization.
11331102034323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13616754 (or 13616751 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 11331102034323 its reverse (32343020113311), we get a palindrome (43674122147634).
The spelling of 11331102034323 in words is "eleven trillion, three hundred thirty-one billion, one hundred two million, thirty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •