Base | Representation |
---|---|
bin | 100110010101101111111011… |
… | …000001101110101000000001 |
3 | 211010000221112220100000021001 |
4 | 212111233323001232220001 |
5 | 134100133420121424001 |
6 | 1354343040021532001 |
7 | 50342263014361621 |
oct | 4625577301565001 |
9 | 733027486300231 |
10 | 168620332608001 |
11 | 4980053291a37a |
12 | 16ab3900274001 |
13 | 7311aa17c7581 |
14 | 2d8d3a65b4881 |
15 | 14763061c2001 |
hex | 995bfb06ea01 |
168620332608001 has 8 divisors (see below), whose sum is σ = 172722786873120. Its totient is φ = 164526107942112.
The previous prime is 168620332607939. The next prime is 168620332608017. The reversal of 168620332608001 is 100806233026861.
168620332608001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 168620332608001 - 223 = 168620324219393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (168620332608401) 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, 2057358331 + ... + 2057440288.
It is an arithmetic number, because the mean of its divisors is an integer number (21590348359140).
Almost surely, 2168620332608001 is an apocalyptic number.
It is an amenable number.
168620332608001 is a deficient number, since it is larger than the sum of its proper divisors (4102454265119).
168620332608001 is an equidigital number, since it uses as much as digits as its factorization.
168620332608001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4114799615.
The product of its (nonzero) digits is 497664, while the sum is 46.
The spelling of 168620332608001 in words is "one hundred sixty-eight trillion, six hundred twenty billion, three hundred thirty-two million, six hundred eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •