Base | Representation |
---|---|
bin | 1001101011100000111110… |
… | …0000111001111111101001 |
3 | 1101200110221011021012221211 |
4 | 2122320033200321333221 |
5 | 2343334222421301011 |
6 | 34345225202433121 |
7 | 2145642102614245 |
oct | 232701740717751 |
9 | 41613834235854 |
10 | 10643189243881 |
11 | 34338299517a7 |
12 | 123a87a6627a1 |
13 | 5c285780c02c |
14 | 28b1c1369425 |
15 | 136cc176db21 |
hex | 9ae0f839fe9 |
10643189243881 has 2 divisors, whose sum is σ = 10643189243882. Its totient is φ = 10643189243880.
The previous prime is 10643189243849. The next prime is 10643189243909. The reversal of 10643189243881 is 18834298134601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6584273888256 + 4058915355625 = 2565984^2 + 2014675^2 .
It is an emirp because it is prime and its reverse (18834298134601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10643189243881 - 25 = 10643189243849 is a prime.
It is a super-2 number, since 2×106431892438812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10643189244881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321594621940 + 5321594621941.
It is an arithmetic number, because the mean of its divisors is an integer number (5321594621941).
Almost surely, 210643189243881 is an apocalyptic number.
It is an amenable number.
10643189243881 is a deficient number, since it is larger than the sum of its proper divisors (1).
10643189243881 is an equidigital number, since it uses as much as digits as its factorization.
10643189243881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7962624, while the sum is 58.
The spelling of 10643189243881 in words is "ten trillion, six hundred forty-three billion, one hundred eighty-nine million, two hundred forty-three thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •