Base | Representation |
---|---|
bin | 10011100000010… |
… | …11110010010101 |
3 | 102101220001212011 |
4 | 21300023302111 |
5 | 313342014013 |
6 | 24123024221 |
7 | 4024541056 |
oct | 1160136225 |
9 | 371801764 |
10 | 163626133 |
11 | 843a9810 |
12 | 4696b071 |
13 | 27b900c8 |
14 | 17a3472d |
15 | e571c3d |
hex | 9c0bc95 |
163626133 has 8 divisors (see below), whose sum is σ = 178920576. Its totient is φ = 148401600.
The previous prime is 163626131. The next prime is 163626181. The reversal of 163626133 is 331626361.
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 163626133 - 21 = 163626131 is a prime.
It is a super-2 number, since 2×1636261332 = 53547022801067378, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 163626095 and 163626104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163626131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12516 + ... + 21997.
It is an arithmetic number, because the mean of its divisors is an integer number (22365072).
Almost surely, 2163626133 is an apocalyptic number.
It is an amenable number.
163626133 is a deficient number, since it is larger than the sum of its proper divisors (15294443).
163626133 is a wasteful number, since it uses less digits than its factorization.
163626133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34955.
The product of its digits is 11664, while the sum is 31.
The square root of 163626133 is about 12791.6430922693. The cubic root of 163626133 is about 546.9541084928.
The spelling of 163626133 in words is "one hundred sixty-three million, six hundred twenty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •