Base | Representation |
---|---|
bin | 110000001100100011001… |
… | …111010110010000110010 |
3 | 102201121212202000212222000 |
4 | 300030203033112100302 |
5 | 413230444304323442 |
6 | 11013303350154430 |
7 | 461166502043532 |
oct | 60144317262062 |
9 | 12647782025860 |
10 | 3312011011122 |
11 | 1067685965450 |
12 | 455a81952a16 |
13 | 1b0423b7a188 |
14 | b64332c14c2 |
15 | 5b2465ead4c |
hex | 303233d6432 |
3312011011122 has 64 divisors (see below), whose sum is σ = 8148955276800. Its totient is φ = 988659991440.
The previous prime is 3312011011121. The next prime is 3312011011147. The reversal of 3312011011122 is 2211101102133.
3312011011122 is a `hidden beast` number, since 331 + 201 + 1 + 0 + 11 + 122 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 3312011011095 and 3312011011104.
It is not an unprimeable number, because it can be changed into a prime (3312011011121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41570472 + ... + 41650067.
It is an arithmetic number, because the mean of its divisors is an integer number (127327426200).
Almost surely, 23312011011122 is an apocalyptic number.
3312011011122 is an abundant number, since it is smaller than the sum of its proper divisors (4836944265678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3312011011122 is a wasteful number, since it uses less digits than its factorization.
3312011011122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83220628 (or 83220622 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 3312011011122 its reverse (2211101102133), we get a palindrome (5523112113255).
The spelling of 3312011011122 in words is "three trillion, three hundred twelve billion, eleven million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •