Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110011000000101000111 |
3 | 1111010020122001222202102221 |
4 | 2210320330012120011013 |
5 | 2441122124300000203 |
6 | 40033241124113211 |
7 | 2246435005046440 |
oct | 244707406300507 |
9 | 44106561882387 |
10 | 11331132031303 |
11 | 36795626a20a7 |
12 | 1330071235807 |
13 | 6426a1002156 |
14 | 2b26031dc2c7 |
15 | 149b37053abd |
hex | a4e3c198147 |
11331132031303 has 16 divisors (see below), whose sum is σ = 13043271808000. Its totient is φ = 9642346507872.
The previous prime is 11331132031301. The next prime is 11331132031313. The reversal of 11331132031303 is 30313023113311.
It is a cyclic number.
It is not a de Polignac number, because 11331132031303 - 21 = 11331132031301 is a prime.
It is a super-2 number, since 2×113311320313032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331132031301) 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 15 ways as a sum of consecutive naturals, for example, 99061378 + ... + 99175696.
It is an arithmetic number, because the mean of its divisors is an integer number (815204488000).
Almost surely, 211331132031303 is an apocalyptic number.
11331132031303 is a deficient number, since it is larger than the sum of its proper divisors (1712139776697).
11331132031303 is a wasteful number, since it uses less digits than its factorization.
11331132031303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216334.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 11331132031303 its reverse (30313023113311), we get a palindrome (41644155144614).
The spelling of 11331132031303 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •