Base | Representation |
---|---|
bin | 10011011100111011… |
… | …10001000000111001 |
3 | 222221210210010011001 |
4 | 21232131301000321 |
5 | 132341431400124 |
6 | 4444134405001 |
7 | 516536000311 |
oct | 115635610071 |
9 | 28853703131 |
10 | 10443231289 |
11 | 4479a28267 |
12 | 2035500761 |
13 | ca57872ca |
14 | 710d7c441 |
15 | 411c60b44 |
hex | 26e771039 |
10443231289 has 2 divisors, whose sum is σ = 10443231290. Its totient is φ = 10443231288.
The previous prime is 10443231277. The next prime is 10443231311. The reversal of 10443231289 is 98213234401.
10443231289 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9227523600 + 1215707689 = 96060^2 + 34867^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10443231289 is a prime.
It is a super-2 number, since 2×104432312892 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10443531289) 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 as a sum of consecutive naturals, namely, 5221615644 + 5221615645.
It is an arithmetic number, because the mean of its divisors is an integer number (5221615645).
Almost surely, 210443231289 is an apocalyptic number.
It is an amenable number.
10443231289 is a deficient number, since it is larger than the sum of its proper divisors (1).
10443231289 is an equidigital number, since it uses as much as digits as its factorization.
10443231289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 10443231289 in words is "ten billion, four hundred forty-three million, two hundred thirty-one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •