Base | Representation |
---|---|
bin | 100101010010000000100100… |
… | …111010010101010110010100 |
3 | 210111112221002000211212000112 |
4 | 211102000210322111112110 |
5 | 132442401403413414133 |
6 | 1340420340435502152 |
7 | 46352046520511222 |
oct | 4522004472252624 |
9 | 714487060755015 |
10 | 163965290763668 |
11 | 48276320084969 |
12 | 164816a4157958 |
13 | 7064b258b1ba4 |
14 | 2c6bd68c29b12 |
15 | 13e51a8084648 |
hex | 952024e95594 |
163965290763668 has 12 divisors (see below), whose sum is σ = 294694373940372. Its totient is φ = 79766898209280.
The previous prime is 163965290763667. The next prime is 163965290763689. The reversal of 163965290763668 is 866367092569361.
It can be written as a sum of positive squares in 2 ways, for example, as 98818470799504 + 65146819964164 = 9940748^2 + 8071358^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163965290763661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553936792973 + ... + 553936793268.
It is an arithmetic number, because the mean of its divisors is an integer number (24557864495031).
Almost surely, 2163965290763668 is an apocalyptic number.
It is an amenable number.
163965290763668 is a deficient number, since it is larger than the sum of its proper divisors (130729083176704).
163965290763668 is a wasteful number, since it uses less digits than its factorization.
163965290763668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1107873586282 (or 1107873586280 counting only the distinct ones).
The product of its (nonzero) digits is 3174474240, while the sum is 77.
The spelling of 163965290763668 in words is "one hundred sixty-three trillion, nine hundred sixty-five billion, two hundred ninety million, seven hundred sixty-three thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •