Base | Representation |
---|---|
bin | 10011011001001… |
… | …00110011110101 |
3 | 102100010000002011 |
4 | 21230210303311 |
5 | 313121230203 |
6 | 24050444221 |
7 | 4013520604 |
oct | 1154446365 |
9 | 370100064 |
10 | 162680053 |
11 | 83912a28 |
12 | 46593671 |
13 | 2791b5b3 |
14 | 17869a3b |
15 | e43676d |
hex | 9b24cf5 |
162680053 has 4 divisors (see below), whose sum is σ = 168289740. Its totient is φ = 157070368.
The previous prime is 162680029. The next prime is 162680059. The reversal of 162680053 is 350086261.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 350086261 = 7 ⋅50012323.
It can be written as a sum of positive squares in 2 ways, for example, as 92505924 + 70174129 = 9618^2 + 8377^2 .
It is a cyclic number.
It is not a de Polignac number, because 162680053 - 225 = 129125621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 162679997 and 162680024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (162680059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2804800 + ... + 2804857.
It is an arithmetic number, because the mean of its divisors is an integer number (42072435).
Almost surely, 2162680053 is an apocalyptic number.
It is an amenable number.
162680053 is a deficient number, since it is larger than the sum of its proper divisors (5609687).
162680053 is an equidigital number, since it uses as much as digits as its factorization.
162680053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5609686.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 162680053 is about 12754.6090884825. The cubic root of 162680053 is about 545.8979143809.
The spelling of 162680053 in words is "one hundred sixty-two million, six hundred eighty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •