Base | Representation |
---|---|
bin | 10011011101100… |
… | …01101101000000 |
3 | 102101012022201012 |
4 | 21232301231000 |
5 | 313243212102 |
6 | 24111100052 |
7 | 4021443242 |
oct | 1156615500 |
9 | 371168635 |
10 | 163257152 |
11 | 84177573 |
12 | 46811628 |
13 | 27a91186 |
14 | 1797a092 |
15 | e4ec752 |
hex | 9bb1b40 |
163257152 has 28 divisors (see below), whose sum is σ = 325168260. Its totient is φ = 81325056.
The previous prime is 163257109. The next prime is 163257173. The reversal of 163257152 is 251752361.
163257152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 26460736 + 136796416 = 5144^2 + 11696^2 .
It is a super-2 number, since 2×1632571522 = 53305795358302208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 13124 + ... + 22332.
Almost surely, 2163257152 is an apocalyptic number.
It is an amenable number.
163257152 is a deficient number, since it is larger than the sum of its proper divisors (161911108).
163257152 is an equidigital number, since it uses as much as digits as its factorization.
163257152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9498 (or 9488 counting only the distinct ones).
The product of its digits is 12600, while the sum is 32.
The square root of 163257152 is about 12777.2122155030. The cubic root of 163257152 is about 546.5426673611.
The spelling of 163257152 in words is "one hundred sixty-three million, two hundred fifty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •