Base | Representation |
---|---|
bin | 10011100000010… |
… | …10010100100101 |
3 | 102101212202121221 |
4 | 21300022110211 |
5 | 313341321013 |
6 | 24122540341 |
7 | 4024514425 |
oct | 1160122445 |
9 | 371782557 |
10 | 163620133 |
11 | 843a5256 |
12 | 469676b1 |
13 | 27b8a461 |
14 | 17a32485 |
15 | e57008d |
hex | 9c0a525 |
163620133 has 2 divisors, whose sum is σ = 163620134. Its totient is φ = 163620132.
The previous prime is 163620131. The next prime is 163620143. The reversal of 163620133 is 331026361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104898564 + 58721569 = 10242^2 + 7663^2 .
It is a cyclic number.
It is not a de Polignac number, because 163620133 - 21 = 163620131 is a prime.
Together with 163620131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 163620098 and 163620107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (163620131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81810066 + 81810067.
It is an arithmetic number, because the mean of its divisors is an integer number (81810067).
Almost surely, 2163620133 is an apocalyptic number.
It is an amenable number.
163620133 is a deficient number, since it is larger than the sum of its proper divisors (1).
163620133 is an equidigital number, since it uses as much as digits as its factorization.
163620133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
The square root of 163620133 is about 12791.4085619997. The cubic root of 163620133 is about 546.9474229985.
Adding to 163620133 its reverse (331026361), we get a palindrome (494646494).
The spelling of 163620133 in words is "one hundred sixty-three million, six hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •