Base | Representation |
---|---|
bin | 1001011111110000001… |
… | …1111111111010011000 |
3 | 120121002200202200021022 |
4 | 2113330003333322120 |
5 | 10133104012242400 |
6 | 202540254102012 |
7 | 14533554016652 |
oct | 2277403777230 |
9 | 517080680238 |
10 | 163142696600 |
11 | 63208887684 |
12 | 277501aa908 |
13 | 124cc393a00 |
14 | 7c790636d2 |
15 | 439c81bb85 |
hex | 25fc0ffe98 |
163142696600 has 144 divisors (see below), whose sum is σ = 420284205000. Its totient is φ = 58835911680.
The previous prime is 163142696569. The next prime is 163142696603. The reversal of 163142696600 is 6696241361.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163142696603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1397276 + ... + 1509524.
Almost surely, 2163142696600 is an apocalyptic number.
163142696600 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 163142696600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210142102500).
163142696600 is an abundant number, since it is smaller than the sum of its proper divisors (257141508400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163142696600 is a wasteful number, since it uses less digits than its factorization.
163142696600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112334 (or 112312 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 44.
The spelling of 163142696600 in words is "one hundred sixty-three billion, one hundred forty-two million, six hundred ninety-six thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •