Base | Representation |
---|---|
bin | 101000010000111… |
… | …101000101101001 |
3 | 1202002010122021201 |
4 | 220100331011221 |
5 | 2340414030121 |
6 | 151011004201 |
7 | 22511636302 |
oct | 5020750551 |
9 | 1662118251 |
10 | 675533161 |
11 | 317359076 |
12 | 16a299661 |
13 | a9c53a84 |
14 | 65a097a9 |
15 | 3e48ce91 |
hex | 2843d169 |
675533161 has 16 divisors (see below), whose sum is σ = 727776000. Its totient is φ = 625382208.
The previous prime is 675533153. The next prime is 675533191. The reversal of 675533161 is 161335576.
It is a cyclic number.
It is not a de Polignac number, because 675533161 - 23 = 675533153 is a prime.
It is a super-2 number, since 2×6755331612 = 912690103221303842, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 675533161.
It is not an unprimeable number, because it can be changed into a prime (675533191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167355 + ... + 171343.
It is an arithmetic number, because the mean of its divisors is an integer number (45486000).
Almost surely, 2675533161 is an apocalyptic number.
It is an amenable number.
675533161 is a deficient number, since it is larger than the sum of its proper divisors (52242839).
675533161 is a wasteful number, since it uses less digits than its factorization.
675533161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4248.
The product of its digits is 56700, while the sum is 37.
The square root of 675533161 is about 25991.0207764143. The cubic root of 675533161 is about 877.4362195291.
The spelling of 675533161 in words is "six hundred seventy-five million, five hundred thirty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •