Base | Representation |
---|---|
bin | 111111001111100… |
… | …110101001011111 |
3 | 2201221120011220222 |
4 | 333033212221133 |
5 | 4133112230241 |
6 | 253142031555 |
7 | 35202551006 |
oct | 7717465137 |
9 | 2657504828 |
10 | 1061055071 |
11 | 4a4a3541a |
12 | 2574185bb |
13 | 13ba9644b |
14 | a0cc1c3d |
15 | 63241a4b |
hex | 3f3e6a5f |
1061055071 has 4 divisors (see below), whose sum is σ = 1081075032. Its totient is φ = 1041035112.
The previous prime is 1061055053. The next prime is 1061055077. The reversal of 1061055071 is 1705501601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1061055071 - 218 = 1060792927 is a prime.
It is a super-2 number, since 2×10610550712 = 2251675727389630082, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1061055071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1061055077) 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, 10009901 + ... + 10010006.
It is an arithmetic number, because the mean of its divisors is an integer number (270268758).
Almost surely, 21061055071 is an apocalyptic number.
1061055071 is a deficient number, since it is larger than the sum of its proper divisors (20019961).
1061055071 is an equidigital number, since it uses as much as digits as its factorization.
1061055071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20019960.
The product of its (nonzero) digits is 1050, while the sum is 26.
The square root of 1061055071 is about 32573.8402863402. The cubic root of 1061055071 is about 1019.9510007860.
Adding to 1061055071 its reverse (1705501601), we get a palindrome (2766556672).
The spelling of 1061055071 in words is "one billion, sixty-one million, fifty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •