Base | Representation |
---|---|
bin | 10011011101100… |
… | …00001101110000 |
3 | 102101012000100102 |
4 | 21232300031300 |
5 | 313243013211 |
6 | 24111011532 |
7 | 4021416413 |
oct | 1156601560 |
9 | 371160312 |
10 | 163251056 |
11 | 84172a31 |
12 | 46809ba8 |
13 | 27a8b477 |
14 | 17977b7a |
15 | e4eaa3b |
hex | 9bb0370 |
163251056 has 40 divisors (see below), whose sum is σ = 331062144. Its totient is φ = 77837760.
The previous prime is 163251041. The next prime is 163251071. The reversal of 163251056 is 650152361.
It is an interprime number because it is at equal distance from previous prime (163251041) and next prime (163251071).
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 7 ways as a sum of consecutive naturals, for example, 200891 + ... + 201701.
Almost surely, 2163251056 is an apocalyptic number.
163251056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 163251056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165531072).
163251056 is an abundant number, since it is smaller than the sum of its proper divisors (167811088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163251056 is a wasteful number, since it uses less digits than its factorization.
163251056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389 (or 1383 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 163251056 is about 12776.9736635872. The cubic root of 163251056 is about 546.5358646666.
The spelling of 163251056 in words is "one hundred sixty-three million, two hundred fifty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •