Base | Representation |
---|---|
bin | 10111110000111… |
… | …00011111110001 |
3 | 111220002211112011 |
4 | 23320130133301 |
5 | 402013034121 |
6 | 31440402521 |
7 | 4640262100 |
oct | 1370343761 |
9 | 456084464 |
10 | 199346161 |
11 | a25867a3 |
12 | 56916441 |
13 | 323b8811 |
14 | 1c692037 |
15 | 1277a7e1 |
hex | be1c7f1 |
199346161 has 9 divisors (see below), whose sum is σ = 232007499. Its totient is φ = 170783424.
The previous prime is 199346159. The next prime is 199346171. The reversal of 199346161 is 161643991.
It is a happy number.
The square root of 199346161 is 14119.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 168610225 + 30735936 = 12985^2 + 5544^2 .
It is not a de Polignac number, because 199346161 - 21 = 199346159 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (199346101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 97825 + ... + 99841.
It is an arithmetic number, because the mean of its divisors is an integer number (25778611).
Almost surely, 2199346161 is an apocalyptic number.
199346161 is the 14119-th square number.
199346161 is the 7060-th centered octagonal number.
It is an amenable number.
199346161 is a deficient number, since it is larger than the sum of its proper divisors (32661338).
199346161 is an frugal number, since it uses more digits than its factorization.
199346161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4048 (or 2024 counting only the distinct ones).
The product of its digits is 34992, while the sum is 40.
The cubic root of 199346161 is about 584.1655729708.
The spelling of 199346161 in words is "one hundred ninety-nine million, three hundred forty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •