Base | Representation |
---|---|
bin | 1001100000001100111… |
… | …0111100101110011100 |
3 | 120121102002011002222220 |
4 | 2120003032330232130 |
5 | 10133330312221034 |
6 | 203000232505340 |
7 | 14536544445012 |
oct | 2300316745634 |
9 | 517362132886 |
10 | 163263007644 |
11 | 6326a7910a0 |
12 | 2778454b250 |
13 | 1251b299389 |
14 | 7c8b0208b2 |
15 | 43a8184749 |
hex | 26033bcb9c |
163263007644 has 96 divisors (see below), whose sum is σ = 463183660800. Its totient is φ = 44112706560.
The previous prime is 163263007643. The next prime is 163263007669. The reversal of 163263007644 is 446700362361.
163263007644 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 163263007596 and 163263007605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163263007643) 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 31 ways as a sum of consecutive naturals, for example, 1871979 + ... + 1957250.
It is an arithmetic number, because the mean of its divisors is an integer number (4824829800).
Almost surely, 2163263007644 is an apocalyptic number.
It is an amenable number.
163263007644 is an abundant number, since it is smaller than the sum of its proper divisors (299920653156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163263007644 is a wasteful number, since it uses less digits than its factorization.
163263007644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3829283 (or 3829281 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 42.
The spelling of 163263007644 in words is "one hundred sixty-three billion, two hundred sixty-three million, seven thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •