Base | Representation |
---|---|
bin | 10011011101010… |
… | …11001110001110 |
3 | 102101010222022000 |
4 | 21232223032032 |
5 | 313241334411 |
6 | 24110333130 |
7 | 4021302660 |
oct | 1156531616 |
9 | 371128260 |
10 | 163230606 |
11 | 84159630 |
12 | 467ba1a6 |
13 | 27a82076 |
14 | 17970530 |
15 | e4e4956 |
hex | 9bab38e |
163230606 has 128 divisors (see below), whose sum is σ = 464901120. Its totient is φ = 41212800.
The previous prime is 163230581. The next prime is 163230611. The reversal of 163230606 is 606032361.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 163230606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 153316 + ... + 154376.
It is an arithmetic number, because the mean of its divisors is an integer number (3632040).
Almost surely, 2163230606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 163230606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232450560).
163230606 is an abundant number, since it is smaller than the sum of its proper divisors (301670514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163230606 is a wasteful number, since it uses less digits than its factorization.
163230606 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1127 (or 1121 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 163230606 is about 12776.1733707711. The cubic root of 163230606 is about 546.5130427108.
Adding to 163230606 its reverse (606032361), we get a palindrome (769262967).
The spelling of 163230606 in words is "one hundred sixty-three million, two hundred thirty thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •