Base | Representation |
---|---|
bin | 100011111101110001111000… |
… | …0010010001111000001101000 |
3 | 1112111010011100010020200012222 |
4 | 1013323203300102033001220 |
5 | 312431121240432404102 |
6 | 3040455030422253212 |
7 | 123430555364011610 |
oct | 10773436022170150 |
9 | 1474104303220188 |
10 | 316354142466152 |
11 | 918890470a538a |
12 | 2b593676287208 |
13 | 1076a0b5771b3b |
14 | 581989d423a40 |
15 | 268916d2a5aa2 |
hex | 11fb8f048f068 |
316354142466152 has 32 divisors (see below), whose sum is σ = 679365884524800. Its totient is φ = 135287516637504.
The previous prime is 316354142466121. The next prime is 316354142466179. The reversal of 316354142466152 is 251664241453613.
It is a junction number, because it is equal to n+sod(n) for n = 316354142466094 and 316354142466103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6100601627 + ... + 6100653482.
It is an arithmetic number, because the mean of its divisors is an integer number (21230183891400).
Almost surely, 2316354142466152 is an apocalyptic number.
It is an amenable number.
316354142466152 is an abundant number, since it is smaller than the sum of its proper divisors (363011742058648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
316354142466152 is a wasteful number, since it uses less digits than its factorization.
316354142466152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12201255585 (or 12201255581 counting only the distinct ones).
The product of its digits is 12441600, while the sum is 53.
The spelling of 316354142466152 in words is "three hundred sixteen trillion, three hundred fifty-four billion, one hundred forty-two million, four hundred sixty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •