Base | Representation |
---|---|
bin | 10011001100011… |
… | …11100001100000 |
3 | 102012222122220201 |
4 | 21212033201200 |
5 | 312210120000 |
6 | 23551114544 |
7 | 3663435031 |
oct | 1146174140 |
9 | 365878821 |
10 | 161020000 |
11 | 82989789 |
12 | 45b12a54 |
13 | 27489b0b |
14 | 17556a88 |
15 | e20996a |
hex | 998f860 |
161020000 has 120 divisors (see below), whose sum is σ = 405039096. Its totient is φ = 62976000.
The previous prime is 161019949. The next prime is 161020001. The reversal of 161020000 is 20161.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161020001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1659952 + ... + 1660048.
Almost surely, 2161020000 is an apocalyptic number.
161020000 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 161020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202519548).
161020000 is an abundant number, since it is smaller than the sum of its proper divisors (244019096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161020000 is an frugal number, since it uses more digits than its factorization.
161020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210 (or 187 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 161020000 is about 12689.3656263818. The cubic root of 161020000 is about 544.0347079931.
Adding to 161020000 its reverse (20161), we get a palindrome (161040161).
The spelling of 161020000 in words is "one hundred sixty-one million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •