Base | Representation |
---|---|
bin | 11110110001001100101000… |
… | …11111100100001110000100 |
3 | 22212120100011011112221010102 |
4 | 33120212110133210032010 |
5 | 32332024423421213201 |
6 | 355523030233343232 |
7 | 20152232260114610 |
oct | 1730462437441604 |
9 | 285510134487112 |
10 | 67661111116676 |
11 | 1a616a09338450 |
12 | 7709215267b18 |
13 | 2b9a55283508c |
14 | 129cb5b09a340 |
15 | 7c504a1a226b |
hex | 3d89947e4384 |
67661111116676 has 192 divisors, whose sum is σ = 160941150720000. Its totient is φ = 24084532846080.
The previous prime is 67661111116631. The next prime is 67661111116681.
It is a happy number.
67661111116676 is nontrivially palindromic in base 10.
It is a super-3 number, since 3×676611111166763 (a number of 42 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 144527225 + ... + 144994623.
It is an arithmetic number, because the mean of its divisors is an integer number (838235160000).
Almost surely, 267661111116676 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 67661111116676, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80470575360000).
67661111116676 is an abundant number, since it is smaller than the sum of its proper divisors (93280039603324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67661111116676 is a wasteful number, since it uses less digits than its factorization.
67661111116676 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468322 (or 468320 counting only the distinct ones).
The product of its digits is 2286144, while the sum is 56.
The spelling of 67661111116676 in words is "sixty-seven trillion, six hundred sixty-one billion, one hundred eleven million, one hundred sixteen thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •