Base | Representation |
---|---|
bin | 1010010011100100000000… |
… | …1010011011100101000010 |
3 | 1111010020210211021020112100 |
4 | 2210321000022123211002 |
5 | 2441122244222444244 |
6 | 40033252001211230 |
7 | 2246436463360113 |
oct | 244710012334502 |
9 | 44106724236470 |
10 | 11331200203074 |
11 | 3679598124604 |
12 | 1330090030b16 |
13 | 6426b218078b |
14 | 2b260c2a620a |
15 | 149b3d01cb69 |
hex | a4e4029b942 |
11331200203074 has 48 divisors (see below), whose sum is σ = 24698762000640. Its totient is φ = 3754325427840.
The previous prime is 11331200203073. The next prime is 11331200203163. The reversal of 11331200203074 is 47030200213311.
It is a happy number.
11331200203074 is a `hidden beast` number, since 1 + 1 + 331 + 2 + 0 + 0 + 20 + 307 + 4 = 666.
It is not an unprimeable number, because it can be changed into a prime (11331200203073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 155166282 + ... + 155239290.
It is an arithmetic number, because the mean of its divisors is an integer number (514557541680).
Almost surely, 211331200203074 is an apocalyptic number.
11331200203074 is an abundant number, since it is smaller than the sum of its proper divisors (13367561797566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331200203074 is a wasteful number, since it uses less digits than its factorization.
11331200203074 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124815 (or 124812 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
Adding to 11331200203074 its reverse (47030200213311), we get a palindrome (58361400416385).
The spelling of 11331200203074 in words is "eleven trillion, three hundred thirty-one billion, two hundred million, two hundred three thousand, seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •