Base | Representation |
---|---|
bin | 111111001111110… |
… | …101100010101001 |
3 | 2201221200021121022 |
4 | 333033311202221 |
5 | 4133121203243 |
6 | 253143222225 |
7 | 35203223603 |
oct | 7717654251 |
9 | 2657607538 |
10 | 1061116073 |
11 | 4a4a77236 |
12 | 257447975 |
13 | 13bab8144 |
14 | a0cda173 |
15 | 63254b68 |
hex | 3f3f58a9 |
1061116073 has 8 divisors (see below), whose sum is σ = 1075061568. Its totient is φ = 1047198384.
The previous prime is 1061116037. The next prime is 1061116079. The reversal of 1061116073 is 3706111601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1061116073 - 212 = 1061111977 is a prime.
It is a super-2 number, since 2×10611160732 = 2251934640757882658, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1061116079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76340 + ... + 89162.
It is an arithmetic number, because the mean of its divisors is an integer number (134382696).
Almost surely, 21061116073 is an apocalyptic number.
It is an amenable number.
1061116073 is a deficient number, since it is larger than the sum of its proper divisors (13945495).
1061116073 is an equidigital number, since it uses as much as digits as its factorization.
1061116073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13903.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 1061116073 is about 32574.7766377607. The cubic root of 1061116073 is about 1019.9705466953.
Adding to 1061116073 its reverse (3706111601), we get a palindrome (4767227674).
The spelling of 1061116073 in words is "one billion, sixty-one million, one hundred sixteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •