Base | Representation |
---|---|
bin | 10011111000000110… |
… | …10010011001001001 |
3 | 1000112200200122211221 |
4 | 21330003102121021 |
5 | 133323304434040 |
6 | 4522520122041 |
7 | 525304313065 |
oct | 117403223111 |
9 | 30480618757 |
10 | 10671171145 |
11 | 4586663908 |
12 | 2099906321 |
13 | 1010a7496b |
14 | 733354aa5 |
15 | 426c8874a |
hex | 27c0d2649 |
10671171145 has 4 divisors (see below), whose sum is σ = 12805405380. Its totient is φ = 8536936912.
The previous prime is 10671171139. The next prime is 10671171163. The reversal of 10671171145 is 54117117601.
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 3001615369 + 7669555776 = 54787^2 + 87576^2 .
It is a cyclic number.
It is not a de Polignac number, because 10671171145 - 29 = 10671170633 is a prime.
It is a super-2 number, since 2×106711711452 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10671171145.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1067117110 + ... + 1067117119.
It is an arithmetic number, because the mean of its divisors is an integer number (3201351345).
Almost surely, 210671171145 is an apocalyptic number.
It is an amenable number.
10671171145 is a deficient number, since it is larger than the sum of its proper divisors (2134234235).
10671171145 is an equidigital number, since it uses as much as digits as its factorization.
10671171145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2134234234.
The product of its (nonzero) digits is 5880, while the sum is 34.
Adding to 10671171145 its reverse (54117117601), we get a palindrome (64788288746).
The spelling of 10671171145 in words is "ten billion, six hundred seventy-one million, one hundred seventy-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •