Base | Representation |
---|---|
bin | 1010010011100011101110… |
… | …0000001010010010001011 |
3 | 1111010020121101010210100122 |
4 | 2210320323200022102023 |
5 | 2441122114213411243 |
6 | 40033240125253455 |
7 | 2246434523643500 |
oct | 244707340122213 |
9 | 44106541123318 |
10 | 11331122013323 |
11 | 3679557a7a482 |
12 | 1330069a0428b |
13 | 64269bc05358 |
14 | 2b2601b514a7 |
15 | 149b36225668 |
hex | a4e3b80a48b |
11331122013323 has 96 divisors (see below), whose sum is σ = 14648315270400. Its totient is φ = 8697898008576.
The previous prime is 11331122013259. The next prime is 11331122013349. The reversal of 11331122013323 is 32331022113311.
It is not a de Polignac number, because 11331122013323 - 26 = 11331122013259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331122013292 and 11331122013301.
It is not an unprimeable number, because it can be changed into a prime (11331122013923) 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 95 ways as a sum of consecutive naturals, for example, 560021615 + ... + 560041847.
It is an arithmetic number, because the mean of its divisors is an integer number (152586617400).
Almost surely, 211331122013323 is an apocalyptic number.
11331122013323 is a deficient number, since it is larger than the sum of its proper divisors (3317193257077).
11331122013323 is a wasteful number, since it uses less digits than its factorization.
11331122013323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20629 (or 20622 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 11331122013323 its reverse (32331022113311), we get a palindrome (43662144126634).
The spelling of 11331122013323 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-two million, thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •