Base | Representation |
---|---|
bin | 10011011100100… |
… | …11010011100101 |
3 | 102100221222220211 |
4 | 21232103103211 |
5 | 313230221040 |
6 | 24104255421 |
7 | 4020414244 |
oct | 1156232345 |
9 | 370858824 |
10 | 163132645 |
11 | 840a1a75 |
12 | 46771571 |
13 | 27a495c0 |
14 | 1794695b |
15 | e4c58ea |
hex | 9b934e5 |
163132645 has 24 divisors (see below), whose sum is σ = 216229608. Its totient is φ = 117450240.
The previous prime is 163132603. The next prime is 163132649. The reversal of 163132645 is 546231361.
It can be written as a sum of positive squares in 12 ways, for example, as 117353889 + 45778756 = 10833^2 + 6766^2 .
It is not a de Polignac number, because 163132645 - 27 = 163132517 is a prime.
It is a super-2 number, since 2×1631326452 = 53224519729392050, which contains 22 as substring.
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163132649) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 108519 + ... + 110011.
It is an arithmetic number, because the mean of its divisors is an integer number (9009567).
Almost surely, 2163132645 is an apocalyptic number.
It is an amenable number.
163132645 is a deficient number, since it is larger than the sum of its proper divisors (53096963).
163132645 is a wasteful number, since it uses less digits than its factorization.
163132645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1593 (or 1552 counting only the distinct ones).
The product of its digits is 12960, while the sum is 31.
The square root of 163132645 is about 12772.3390575102. The cubic root of 163132645 is about 546.4036929614.
The spelling of 163132645 in words is "one hundred sixty-three million, one hundred thirty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •