Base | Representation |
---|---|
bin | 10111100001101001111… |
… | …011001010011110000000 |
3 | 12201112221112201011200121 |
4 | 113201221323022132000 |
5 | 202441432303222402 |
6 | 3234410022230024 |
7 | 224541646144120 |
oct | 27415173123600 |
9 | 5645845634617 |
10 | 1616684820352 |
11 | 5736a5485a18 |
12 | 2213a8585314 |
13 | b95b68352c4 |
14 | 583685a4c80 |
15 | 2c0c129e837 |
hex | 17869eca780 |
1616684820352 has 64 divisors (see below), whose sum is σ = 3681027734400. Its totient is φ = 692830508544.
The previous prime is 1616684820341. The next prime is 1616684820353. The reversal of 1616684820352 is 2530284866161.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×16166848203522 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1616684820352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1616684820353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27333403 + ... + 27392485.
It is an arithmetic number, because the mean of its divisors is an integer number (57516058350).
Almost surely, 21616684820352 is an apocalyptic number.
It is an amenable number.
1616684820352 is an abundant number, since it is smaller than the sum of its proper divisors (2064342914048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1616684820352 is an equidigital number, since it uses as much as digits as its factorization.
1616684820352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89643 (or 89631 counting only the distinct ones).
The product of its (nonzero) digits is 3317760, while the sum is 52.
The spelling of 1616684820352 in words is "one trillion, six hundred sixteen billion, six hundred eighty-four million, eight hundred twenty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •