Base | Representation |
---|---|
bin | 1011010010100010… |
… | …10010000101011101 |
3 | 120122102001001122221 |
4 | 11221101102011131 |
5 | 44403120334001 |
6 | 2441234305341 |
7 | 303125355343 |
oct | 55121220535 |
9 | 16572031587 |
10 | 6061105501 |
11 | 2630377300 |
12 | 1211a28251 |
13 | 757941c79 |
14 | 416d97993 |
15 | 2571a81a1 |
hex | 16945215d |
6061105501 has 24 divisors (see below), whose sum is σ = 6773631480. Its totient is φ = 5418631680.
The previous prime is 6061105471. The next prime is 6061105517. The reversal of 6061105501 is 1055011606.
It can be written as a sum of positive squares in 4 ways, for example, as 2143597401 + 3917508100 = 46299^2 + 62590^2 .
It is not a de Polignac number, because 6061105501 - 227 = 5926887773 is a prime.
It is a super-2 number, since 2×60611055012 = 73473999788504922002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6061105301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2120065 + ... + 2122921.
It is an arithmetic number, because the mean of its divisors is an integer number (282234645).
Almost surely, 26061105501 is an apocalyptic number.
It is an amenable number.
6061105501 is a deficient number, since it is larger than the sum of its proper divisors (712525979).
6061105501 is a wasteful number, since it uses less digits than its factorization.
6061105501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3165 (or 3154 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The square root of 6061105501 is about 77853.1020640796. The cubic root of 6061105501 is about 1823.2684396565.
It can be divided in two parts, 6061105 and 501, that added together give a palindrome (6061606).
The spelling of 6061105501 in words is "six billion, sixty-one million, one hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •