Base | Representation |
---|---|
bin | 1001000011111101000… |
… | …00010011000101110100 |
3 | 1002202200012211220211200 |
4 | 10201332200103011310 |
5 | 20100131132310312 |
6 | 355011542132500 |
7 | 31331535453354 |
oct | 4417640230564 |
9 | 1082605756750 |
10 | 311360041332 |
11 | 11005769850a |
12 | 50415a21130 |
13 | 23490516a62 |
14 | 110d9b74b64 |
15 | 8174b6c0dc |
hex | 487e813174 |
311360041332 has 72 divisors (see below), whose sum is σ = 798983867136. Its totient is φ = 102213581184.
The previous prime is 311360041327. The next prime is 311360041429. The reversal of 311360041332 is 233140063113.
311360041332 is a `hidden beast` number, since 3 + 1 + 13 + 600 + 4 + 13 + 32 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 311360041296 and 311360041305.
It is a congruent number.
It is an unprimeable number.
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, 12319933 + ... + 12345179.
Almost surely, 2311360041332 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 311360041332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (399491933568).
311360041332 is an abundant number, since it is smaller than the sum of its proper divisors (487623825804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311360041332 is a wasteful number, since it uses less digits than its factorization.
311360041332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30437 (or 30432 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The spelling of 311360041332 in words is "three hundred eleven billion, three hundred sixty million, forty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •