Base | Representation |
---|---|
bin | 10011011101101… |
… | …10000101101000 |
3 | 102101020020100101 |
4 | 21232312011220 |
5 | 313244300422 |
6 | 24111315144 |
7 | 4021546510 |
oct | 1156660550 |
9 | 371206311 |
10 | 163275112 |
11 | 8418a010 |
12 | 4681bab4 |
13 | 27a993c0 |
14 | 17982840 |
15 | e502c27 |
hex | 9bb6168 |
163275112 has 64 divisors (see below), whose sum is σ = 411062400. Its totient is φ = 58717440.
The previous prime is 163275103. The next prime is 163275121. The reversal of 163275112 is 211572361.
It is a happy number.
163275112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (163275103) and next prime (163275121).
It is a super-2 number, since 2×1632751122 = 53317524397225088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2187 + ... + 18202.
It is an arithmetic number, because the mean of its divisors is an integer number (6422850).
Almost surely, 2163275112 is an apocalyptic number.
It is an amenable number.
163275112 is an abundant number, since it is smaller than the sum of its proper divisors (247787288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163275112 is a wasteful number, since it uses less digits than its factorization.
163275112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20426 (or 20422 counting only the distinct ones).
The product of its digits is 2520, while the sum is 28.
The square root of 163275112 is about 12777.9150098911. The cubic root of 163275112 is about 546.5627084359.
The spelling of 163275112 in words is "one hundred sixty-three million, two hundred seventy-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •