Base | Representation |
---|---|
bin | 10011010000100… |
… | …00111010110100 |
3 | 102020222120221111 |
4 | 21220100322310 |
5 | 312324100004 |
6 | 24010324404 |
7 | 4001103160 |
oct | 1150207264 |
9 | 366876844 |
10 | 161550004 |
11 | 83210a00 |
12 | 46129704 |
13 | 27614125 |
14 | 17653ca0 |
15 | e2b1a04 |
hex | 9a10eb4 |
161550004 has 72 divisors (see below), whose sum is σ = 364117824. Its totient is φ = 61353600.
The previous prime is 161549977. The next prime is 161550007. The reversal of 161550004 is 400055161.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161550007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 138327 + ... + 139489.
It is an arithmetic number, because the mean of its divisors is an integer number (5057192).
Almost surely, 2161550004 is an apocalyptic number.
161550004 is a gapful number since it is divisible by the number (14) 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 161550004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182058912).
161550004 is an abundant number, since it is smaller than the sum of its proper divisors (202567820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161550004 is a wasteful number, since it uses less digits than its factorization.
161550004 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1237 (or 1224 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 161550004 is about 12710.2322559425. The cubic root of 161550004 is about 544.6309585355.
The spelling of 161550004 in words is "one hundred sixty-one million, five hundred fifty thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •