Base | Representation |
---|---|
bin | 101101010110000000101… |
… | …101011000001001101100 |
3 | 102000212222010210212010200 |
4 | 231112000231120021230 |
5 | 402023042212344102 |
6 | 10343250414433500 |
7 | 441060435445620 |
oct | 55260055301154 |
9 | 12025863725120 |
10 | 3116010668652 |
11 | aa1546874142 |
12 | 423aa1802890 |
13 | 197ab938c87b |
14 | aab5c4a5180 |
15 | 560c438051c |
hex | 2d580b5826c |
3116010668652 has 288 divisors, whose sum is σ = 9965469696000. Its totient is φ = 800404488576.
The previous prime is 3116010668623. The next prime is 3116010668657. The reversal of 3116010668652 is 2568660106113.
3116010668652 is a `hidden beast` number, since 31 + 1 + 601 + 0 + 6 + 6 + 8 + 6 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 3116010668598 and 3116010668607.
It is not an unprimeable number, because it can be changed into a prime (3116010668657) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13874349 + ... + 14097147.
Almost surely, 23116010668652 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 3116010668652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4982734848000).
3116010668652 is an abundant number, since it is smaller than the sum of its proper divisors (6849459027348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3116010668652 is a wasteful number, since it uses less digits than its factorization.
3116010668652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222985 (or 222980 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 3116010668652 in words is "three trillion, one hundred sixteen billion, ten million, six hundred sixty-eight thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •