Base | Representation |
---|---|
bin | 111100000110010011101011… |
… | …101000011100111111100000 |
3 | 1021122212101102021021121102110 |
4 | 330012103223220130333200 |
5 | 234121024130101133422 |
6 | 2334053112112315320 |
7 | 106450134562515354 |
oct | 7406235350347740 |
9 | 1248771367247373 |
10 | 264316240646112 |
11 | 772459851530a6 |
12 | 2578a312242b40 |
13 | b463bb7336865 |
14 | 493ad8d6d3464 |
15 | 2085712e8960c |
hex | f064eba1cfe0 |
264316240646112 has 48 divisors (see below), whose sum is σ = 717755308658640. Its totient is φ = 85067295839232.
The previous prime is 264316240646063. The next prime is 264316240646119. The reversal of 264316240646112 is 211646042613462.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264316240646119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47470586413 + ... + 47470591980.
It is an arithmetic number, because the mean of its divisors is an integer number (14953235597055).
Almost surely, 2264316240646112 is an apocalyptic number.
It is an amenable number.
264316240646112 is an abundant number, since it is smaller than the sum of its proper divisors (453439068012528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264316240646112 is a wasteful number, since it uses less digits than its factorization.
264316240646112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94941178435 (or 94941178427 counting only the distinct ones).
The product of its (nonzero) digits is 1990656, while the sum is 48.
The spelling of 264316240646112 in words is "two hundred sixty-four trillion, three hundred sixteen billion, two hundred forty million, six hundred forty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •