Base | Representation |
---|---|
bin | 1011011110100001… |
… | …11000000001100101 |
3 | 120220102020212022200 |
4 | 11233100320001211 |
5 | 100104341141203 |
6 | 2455225445113 |
7 | 305456156211 |
oct | 55720700145 |
9 | 16812225280 |
10 | 6161662053 |
11 | 2682108998 |
12 | 123b640799 |
13 | 77271bba1 |
14 | 426491941 |
15 | 260e1c9a3 |
hex | 16f438065 |
6161662053 has 12 divisors (see below), whose sum is σ = 9423718668. Its totient is φ = 3866140800.
The previous prime is 6161662051. The next prime is 6161662093. The reversal of 6161662053 is 3502661616.
6161662053 is a `hidden beast` number, since 6 + 16 + 16 + 620 + 5 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5566204449 + 595457604 = 74607^2 + 24402^2 .
It is not a de Polignac number, because 6161662053 - 21 = 6161662051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6161661999 and 6161662017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6161662051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20135998 + ... + 20136303.
It is an arithmetic number, because the mean of its divisors is an integer number (785309889).
Almost surely, 26161662053 is an apocalyptic number.
It is an amenable number.
6161662053 is a deficient number, since it is larger than the sum of its proper divisors (3262056615).
6161662053 is a wasteful number, since it uses less digits than its factorization.
6161662053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40272324 (or 40272321 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The square root of 6161662053 is about 78496.2550253195. The cubic root of 6161662053 is about 1833.2961440794.
The spelling of 6161662053 in words is "six billion, one hundred sixty-one million, six hundred sixty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •