Base | Representation |
---|---|
bin | 100000000101011… |
… | …0011111101110001 |
3 | 2210000202201210101 |
4 | 1000022303331301 |
5 | 4201100413423 |
6 | 254454432401 |
7 | 35451513604 |
oct | 10012637561 |
9 | 2700681711 |
10 | 1076576113 |
11 | 502776628 |
12 | 260662701 |
13 | 14206bcb2 |
14 | a2da233b |
15 | 647aa7ad |
hex | 402b3f71 |
1076576113 has 4 divisors (see below), whose sum is σ = 1086637680. Its totient is φ = 1066514548.
The previous prime is 1076576101. The next prime is 1076576117. The reversal of 1076576113 is 3116756701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3116756701 = 29 ⋅107474369.
It is a cyclic number.
It is not a de Polignac number, because 1076576113 - 29 = 1076575601 is a prime.
It is a super-2 number, since 2×10765761132 = 2318032254164377538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1076576117) 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, 5030623 + ... + 5030836.
It is an arithmetic number, because the mean of its divisors is an integer number (271659420).
Almost surely, 21076576113 is an apocalyptic number.
It is an amenable number.
1076576113 is a deficient number, since it is larger than the sum of its proper divisors (10061567).
1076576113 is a wasteful number, since it uses less digits than its factorization.
1076576113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10061566.
The product of its (nonzero) digits is 26460, while the sum is 37.
The square root of 1076576113 is about 32811.2193159596. The cubic root of 1076576113 is about 1024.9002046010.
The spelling of 1076576113 in words is "one billion, seventy-six million, five hundred seventy-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •