Base | Representation |
---|---|
bin | 10011111000011001… |
… | …01110010011110101 |
3 | 1000112212100100001101 |
4 | 21330030232103311 |
5 | 133324423113124 |
6 | 4523045130101 |
7 | 525334324633 |
oct | 117414562365 |
9 | 30485310041 |
10 | 10673644789 |
11 | 4587aa3345 |
12 | 209a6b9931 |
13 | 101142c862 |
14 | 7337da353 |
15 | 4270c6644 |
hex | 27c32e4f5 |
10673644789 has 2 divisors, whose sum is σ = 10673644790. Its totient is φ = 10673644788.
The previous prime is 10673644699. The next prime is 10673644811. The reversal of 10673644789 is 98744637601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7852972689 + 2820672100 = 88617^2 + 53110^2 .
It is a cyclic number.
It is not a de Polignac number, because 10673644789 - 217 = 10673513717 is a prime.
It is a super-2 number, since 2×106736447892 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10673642789) 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 as a sum of consecutive naturals, namely, 5336822394 + 5336822395.
It is an arithmetic number, because the mean of its divisors is an integer number (5336822395).
Almost surely, 210673644789 is an apocalyptic number.
It is an amenable number.
10673644789 is a deficient number, since it is larger than the sum of its proper divisors (1).
10673644789 is an equidigital number, since it uses as much as digits as its factorization.
10673644789 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6096384, while the sum is 55.
It can be divided in two parts, 106736 and 44789, that added together give a triangular number (151525 = T550).
The spelling of 10673644789 in words is "ten billion, six hundred seventy-three million, six hundred forty-four thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •