Base | Representation |
---|---|
bin | 1001110111101000110… |
… | …0000100100100110001 |
3 | 121012122111012212110101 |
4 | 2131322030010210301 |
5 | 10234221222144421 |
6 | 205520352232401 |
7 | 15151461515161 |
oct | 2357214044461 |
9 | 535574185411 |
10 | 169553709361 |
11 | 659a8715433 |
12 | 28a3b23b701 |
13 | 12cb165889a |
14 | 82c66a25a1 |
15 | 4625591191 |
hex | 277a304931 |
169553709361 has 9 divisors (see below), whose sum is σ = 177256028089. Its totient is φ = 162172750036.
The previous prime is 169553709359. The next prime is 169553709371. The reversal of 169553709361 is 163907355961.
The square root of 169553709361 is 411769.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 169553709361 - 21 = 169553709359 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (169553709371) 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, 9461736 + ... + 9479638.
Almost surely, 2169553709361 is an apocalyptic number.
169553709361 is the 411769-th square number.
169553709361 is the 205885-th centered octagonal number.
It is an amenable number.
169553709361 is a deficient number, since it is larger than the sum of its proper divisors (7702318728).
169553709361 is an frugal number, since it uses more digits than its factorization.
169553709361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35852 (or 17926 counting only the distinct ones).
The product of its (nonzero) digits is 4592700, while the sum is 55.
The spelling of 169553709361 in words is "one hundred sixty-nine billion, five hundred fifty-three million, seven hundred nine thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •