Base | Representation |
---|---|
bin | 1010010011100100011011… |
… | …1000110101100010011000 |
3 | 1111010021002200120111210021 |
4 | 2210321012320311202120 |
5 | 2441123012114000240 |
6 | 40033311111400224 |
7 | 2246442333401332 |
oct | 244710670654230 |
9 | 44107080514707 |
10 | 11331313031320 |
11 | 3679645888097 |
12 | 1330101983074 |
13 | 6426cc666259 |
14 | 2b261d276452 |
15 | 149b47da854a |
hex | a4e46e35898 |
11331313031320 has 16 divisors (see below), whose sum is σ = 25495454320560. Its totient is φ = 4532525212512.
The previous prime is 11331313031309. The next prime is 11331313031321. The reversal of 11331313031320 is 2313031313311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331313031321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141641412852 + ... + 141641412931.
It is an arithmetic number, because the mean of its divisors is an integer number (1593465895035).
Almost surely, 211331313031320 is an apocalyptic number.
11331313031320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11331313031320 is an abundant number, since it is smaller than the sum of its proper divisors (14164141289240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331313031320 is a wasteful number, since it uses less digits than its factorization.
11331313031320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283282825794 (or 283282825790 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 11331313031320 its reverse (2313031313311), we get a palindrome (13644344344631).
The spelling of 11331313031320 in words is "eleven trillion, three hundred thirty-one billion, three hundred thirteen million, thirty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •