Base | Representation |
---|---|
bin | 100101001011010011001100… |
… | …010011000001110001110101 |
3 | 210102220212000210022121221110 |
4 | 211023103030103001301311 |
5 | 132412323142044023323 |
6 | 1335424451224505233 |
7 | 46303535360463345 |
oct | 4513231423016165 |
9 | 712825023277843 |
10 | 163504242564213 |
11 | 4810883a420771 |
12 | 1640827401b219 |
13 | 70304cb601805 |
14 | 2c5390ccbad25 |
15 | 13d81c1dd5793 |
hex | 94b4cc4c1c75 |
163504242564213 has 8 divisors (see below), whose sum is σ = 222644074981248. Its totient is φ = 106683619261664.
The previous prime is 163504242564203. The next prime is 163504242564217. The reversal of 163504242564213 is 312465242405361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-163504242564213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163504242564217) 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, 579802278456 + ... + 579802278737.
It is an arithmetic number, because the mean of its divisors is an integer number (27830509372656).
Almost surely, 2163504242564213 is an apocalyptic number.
It is an amenable number.
163504242564213 is a deficient number, since it is larger than the sum of its proper divisors (59139832417035).
163504242564213 is a wasteful number, since it uses less digits than its factorization.
163504242564213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1159604557243.
The product of its (nonzero) digits is 4147200, while the sum is 48.
Adding to 163504242564213 its reverse (312465242405361), we get a palindrome (475969484969574).
The spelling of 163504242564213 in words is "one hundred sixty-three trillion, five hundred four billion, two hundred forty-two million, five hundred sixty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •