Base | Representation |
---|---|
bin | 10011001111011001111… |
… | …11111000010101110000 |
3 | 2100012102121212212111101 |
4 | 21213230333320111300 |
5 | 41312421134240404 |
6 | 1223412531254144 |
7 | 65522553453610 |
oct | 11475477702560 |
9 | 2305377785441 |
10 | 661106165104 |
11 | 2354122168a0 |
12 | a816314a354 |
13 | 4a45a616558 |
14 | 23dd79dca40 |
15 | 122e47732a4 |
hex | 99ecff8570 |
661106165104 has 160 divisors (see below), whose sum is σ = 1646681605632. Its totient is φ = 249609600000.
The previous prime is 661106165089. The next prime is 661106165113. The reversal of 661106165104 is 401561601166.
It is a super-2 number, since 2×6611061651042 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 11412694 + ... + 11470474.
Almost surely, 2661106165104 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 661106165104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (823340802816).
661106165104 is an abundant number, since it is smaller than the sum of its proper divisors (985575440528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
661106165104 is a wasteful number, since it uses less digits than its factorization.
661106165104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58095 (or 58089 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 661106165104 in words is "six hundred sixty-one billion, one hundred six million, one hundred sixty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •