Base | Representation |
---|---|
bin | 10000001111111110001… |
… | …011101010110111000000 |
3 | 10221202022000200100100110 |
4 | 100033332023222313000 |
5 | 121243410204023124 |
6 | 2212553104351320 |
7 | 143450620622265 |
oct | 20177613526700 |
9 | 3852260610313 |
10 | 1116661001664 |
11 | 3a063402a15a |
12 | 1604bb615540 |
13 | 813ba797c40 |
14 | 3c09214126c |
15 | 1e0a8514029 |
hex | 103fe2eadc0 |
1116661001664 has 224 divisors, whose sum is σ = 3307155102720. Its totient is φ = 330271838208.
The previous prime is 1116661001657. The next prime is 1116661001717. The reversal of 1116661001664 is 4661001666111.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7592377 + ... + 7738055.
It is an arithmetic number, because the mean of its divisors is an integer number (14764085280).
Almost surely, 21116661001664 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 1116661001664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1653577551360).
1116661001664 is an abundant number, since it is smaller than the sum of its proper divisors (2190494101056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116661001664 is a wasteful number, since it uses less digits than its factorization.
1116661001664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145827 (or 145817 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 39.
Adding to 1116661001664 its reverse (4661001666111), we get a palindrome (5777662667775).
The spelling of 1116661001664 in words is "one trillion, one hundred sixteen billion, six hundred sixty-one million, one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •