Base | Representation |
---|---|
bin | 111111110001011… |
… | …010001100110001 |
3 | 2202120020102011201 |
4 | 333301122030301 |
5 | 4142344320402 |
6 | 254100011201 |
7 | 35341100323 |
oct | 7761321461 |
9 | 2676212151 |
10 | 1069916977 |
11 | 4a9a38508 |
12 | 25a390b01 |
13 | 140879c8c |
14 | a214b613 |
15 | 63de2687 |
hex | 3fc5a331 |
1069916977 has 4 divisors (see below), whose sum is σ = 1092681216. Its totient is φ = 1047152740.
The previous prime is 1069916959. The next prime is 1069917001. The reversal of 1069916977 is 7796199601.
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.
It is a cyclic number.
It is not a de Polignac number, because 1069916977 - 219 = 1069392689 is a prime.
It is a super-2 number, since 2×10699169772 = 2289444675345637058, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1069916077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11382049 + ... + 11382142.
It is an arithmetic number, because the mean of its divisors is an integer number (273170304).
Almost surely, 21069916977 is an apocalyptic number.
It is an amenable number.
1069916977 is a deficient number, since it is larger than the sum of its proper divisors (22764239).
1069916977 is an equidigital number, since it uses as much as digits as its factorization.
1069916977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22764238.
The product of its (nonzero) digits is 1285956, while the sum is 55.
The square root of 1069916977 is about 32709.5853993902. The cubic root of 1069916977 is about 1022.7826672905.
The spelling of 1069916977 in words is "one billion, sixty-nine million, nine hundred sixteen thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •