Base | Representation |
---|---|
bin | 1001001101110000111… |
… | …01111011001110000000 |
3 | 1010021021022102202211102 |
4 | 10212320131323032000 |
5 | 20141423112340323 |
6 | 401242345233532 |
7 | 31606216022054 |
oct | 4467035731600 |
9 | 1107238382742 |
10 | 316627465088 |
11 | 11230aa49990 |
12 | 51445a928a8 |
13 | 23b1c8a894c |
14 | 11479569c64 |
15 | 83822ea328 |
hex | 49b877b380 |
316627465088 has 128 divisors (see below), whose sum is σ = 697394759040. Its totient is φ = 141987788800.
The previous prime is 316627465067. The next prime is 316627465093. The reversal of 316627465088 is 880564726613.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110668778 + ... + 110671638.
It is an arithmetic number, because the mean of its divisors is an integer number (5448396555).
Almost surely, 2316627465088 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 316627465088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (348697379520).
316627465088 is an abundant number, since it is smaller than the sum of its proper divisors (380767293952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
316627465088 is a wasteful number, since it uses less digits than its factorization.
316627465088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3916 (or 3904 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 316627465088 in words is "three hundred sixteen billion, six hundred twenty-seven million, four hundred sixty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.779 sec. • engine limits •