Base | Representation |
---|---|
bin | 10011001101110… |
… | …11101000110100 |
3 | 102020022211210000 |
4 | 21212323220310 |
5 | 312231410232 |
6 | 23555031300 |
7 | 3665116602 |
oct | 1146735064 |
9 | 366284700 |
10 | 161200692 |
11 | 82aa2514 |
12 | 45b9b530 |
13 | 27521133 |
14 | 175a2872 |
15 | e24327c |
hex | 99bba34 |
161200692 has 60 divisors (see below), whose sum is σ = 424228420. Its totient is φ = 53374464.
The previous prime is 161200673. The next prime is 161200729. The reversal of 161200692 is 296002161.
It can be written as a sum of positive squares in 2 ways, for example, as 92044836 + 69155856 = 9594^2 + 8316^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 49284 + ... + 52452.
Almost surely, 2161200692 is an apocalyptic number.
161200692 is a gapful number since it is divisible by the number (12) 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 161200692, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212114210).
161200692 is an abundant number, since it is smaller than the sum of its proper divisors (263027728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161200692 is a wasteful number, since it uses less digits than its factorization.
161200692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3342 (or 3331 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 161200692 is about 12696.4834501526. The cubic root of 161200692 is about 544.2381319395.
The spelling of 161200692 in words is "one hundred sixty-one million, two hundred thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •