Base | Representation |
---|---|
bin | 10011111001010… |
… | …11001101010001 |
3 | 102122001102112021 |
4 | 21330223031101 |
5 | 320211304221 |
6 | 24321131441 |
7 | 4064426362 |
oct | 1174531521 |
9 | 378042467 |
10 | 166900561 |
11 | 86235953 |
12 | 47a89b81 |
13 | 28768639 |
14 | 18247b69 |
15 | e9bc041 |
hex | 9f2b351 |
166900561 has 3 divisors (see below), whose sum is σ = 166913481. Its totient is φ = 166887642.
The previous prime is 166900553. The next prime is 166900583. The reversal of 166900561 is 165009661.
The square root of 166900561 is 12919.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 166900561 - 23 = 166900553 is a prime.
It is a super-2 number, since 2×1669005612 = 55711594524229442, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (166900511) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 6460 + ... + 19378.
It is an arithmetic number, because the mean of its divisors is an integer number (55637827).
Almost surely, 2166900561 is an apocalyptic number.
166900561 is the 12919-th square number.
166900561 is the 6460-th centered octagonal number.
It is an amenable number.
166900561 is a deficient number, since it is larger than the sum of its proper divisors (12920).
166900561 is an frugal number, since it uses more digits than its factorization.
166900561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25838 (or 12919 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 34.
The cubic root of 166900561 is about 550.5785218424.
The spelling of 166900561 in words is "one hundred sixty-six million, nine hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •