Base | Representation |
---|---|
bin | 10011010000100… |
… | …10101000111010 |
3 | 102020222221121110 |
4 | 21220102220322 |
5 | 312324311200 |
6 | 24010421150 |
7 | 4001132544 |
oct | 1150225072 |
9 | 366887543 |
10 | 161557050 |
11 | 83216226 |
12 | 461317b6 |
13 | 276173b5 |
14 | 17656694 |
15 | e2b3b50 |
hex | 9a12a3a |
161557050 has 24 divisors (see below), whose sum is σ = 400661856. Its totient is φ = 43081840.
The previous prime is 161557043. The next prime is 161557051. The reversal of 161557050 is 50755161.
It is a super-2 number, since 2×1615570502 = 52201360809405000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 161556999 and 161557017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161557051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 538374 + ... + 538673.
It is an arithmetic number, because the mean of its divisors is an integer number (16694244).
Almost surely, 2161557050 is an apocalyptic number.
161557050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
161557050 is an abundant number, since it is smaller than the sum of its proper divisors (239104806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161557050 is a wasteful number, since it uses less digits than its factorization.
161557050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1077062 (or 1077057 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 30.
The square root of 161557050 is about 12710.5094311754. The cubic root of 161557050 is about 544.6388764429.
The spelling of 161557050 in words is "one hundred sixty-one million, five hundred fifty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •