Base | Representation |
---|---|
bin | 11110111000011110001… |
… | …01101000010001000001 |
3 | 10202102220120202220210111 |
4 | 33130033011220101001 |
5 | 114341123133243001 |
6 | 2131244531031321 |
7 | 136443203441422 |
oct | 17341705502101 |
9 | 3672816686714 |
10 | 1061110056001 |
11 | 37a017a66506 |
12 | 15179773b541 |
13 | 790a69b78a8 |
14 | 395024d5649 |
15 | 1c906689851 |
hex | f70f168441 |
1061110056001 has 4 divisors (see below), whose sum is σ = 1061112322900. Its totient is φ = 1061107789104.
The previous prime is 1061110055987. The next prime is 1061110056029. The reversal of 1061110056001 is 1006500111601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1039225291776 + 21884764225 = 1019424^2 + 147935^2 .
It is a cyclic number.
It is not a de Polignac number, because 1061110056001 - 25 = 1061110055969 is a prime.
It is a super-2 number, since 2×10611100560012 (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 (1061110056701) 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, 142566 + ... + 1463743.
It is an arithmetic number, because the mean of its divisors is an integer number (265278080725).
Almost surely, 21061110056001 is an apocalyptic number.
It is an amenable number.
1061110056001 is a deficient number, since it is larger than the sum of its proper divisors (2266899).
1061110056001 is an equidigital number, since it uses as much as digits as its factorization.
1061110056001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2266898.
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 1061110056001 its reverse (1006500111601), we get a palindrome (2067610167602).
The spelling of 1061110056001 in words is "one trillion, sixty-one billion, one hundred ten million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •