Base | Representation |
---|---|
bin | 11110110110100000100… |
… | …10101001110011011001 |
3 | 10202100012011100000021211 |
4 | 33123100102221303121 |
5 | 114331443431134221 |
6 | 2130552213503121 |
7 | 136405121424664 |
oct | 17332022516331 |
9 | 3670164300254 |
10 | 1060056505561 |
11 | 379627297469 |
12 | 151542941aa1 |
13 | 78c6964b271 |
14 | 394426086db |
15 | 1c893e2b6e1 |
hex | f6d04a9cd9 |
1060056505561 has 32 divisors (see below), whose sum is σ = 1169511146496. Its totient is φ = 956693760000.
The previous prime is 1060056505511. The next prime is 1060056505621. The reversal of 1060056505561 is 1655056500601.
It is a cyclic number.
It is not a de Polignac number, because 1060056505561 - 233 = 1051466570969 is a prime.
It is a super-2 number, since 2×10600565055612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1060056505511) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61683576 + ... + 61700758.
It is an arithmetic number, because the mean of its divisors is an integer number (36547223328).
Almost surely, 21060056505561 is an apocalyptic number.
It is an amenable number.
1060056505561 is a deficient number, since it is larger than the sum of its proper divisors (109454640935).
1060056505561 is a wasteful number, since it uses less digits than its factorization.
1060056505561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18753.
The product of its (nonzero) digits is 135000, while the sum is 40.
The spelling of 1060056505561 in words is "one trillion, sixty billion, fifty-six million, five hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •