Base | Representation |
---|---|
bin | 10011011101011… |
… | …11111101010000 |
3 | 102101011221220022 |
4 | 21232233331100 |
5 | 313243000000 |
6 | 24111003012 |
7 | 4021413344 |
oct | 1156577520 |
9 | 371157808 |
10 | 163250000 |
11 | 84172161 |
12 | 46809468 |
13 | 27a8ab44 |
14 | 17977624 |
15 | e4ea585 |
hex | 9baff50 |
163250000 has 70 divisors (see below), whose sum is σ = 395971494. Its totient is φ = 65200000.
The previous prime is 163249993. The next prime is 163250011. The reversal of 163250000 is 52361.
It can be written as a sum of positive squares in 7 ways, for example, as 158357056 + 4892944 = 12584^2 + 2212^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 249674 + ... + 250326.
Almost surely, 2163250000 is an apocalyptic number.
163250000 is a gapful number since it is divisible by the number (10) 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 163250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197985747).
163250000 is an abundant number, since it is smaller than the sum of its proper divisors (232721494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163250000 is an frugal number, since it uses more digits than its factorization.
163250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 691 (or 660 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 163250000 is about 12776.9323391806. The cubic root of 163250000 is about 546.5346862299.
The spelling of 163250000 in words is "one hundred sixty-three million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •