Base | Representation |
---|---|
bin | 110001100100010000… |
… | …1100111010100111111 |
3 | 101011202020011112121001 |
4 | 1203020201213110333 |
5 | 3220444012021033 |
6 | 120522140551131 |
7 | 10455524365513 |
oct | 1431041472477 |
9 | 334666145531 |
10 | 106443470143 |
11 | 4116262263a |
12 | 187678524a7 |
13 | a064729c7a |
14 | 521ab0c143 |
15 | 2b7ec70e7d |
hex | 18c886753f |
106443470143 has 2 divisors, whose sum is σ = 106443470144. Its totient is φ = 106443470142.
The previous prime is 106443470141. The next prime is 106443470153. The reversal of 106443470143 is 341074344601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106443470143 - 21 = 106443470141 is a prime.
It is a super-2 number, since 2×1064434701432 (a number of 23 digits) contains 22 as substring.
Together with 106443470141, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106443470141) 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, 53221735071 + 53221735072.
It is an arithmetic number, because the mean of its divisors is an integer number (53221735072).
Almost surely, 2106443470143 is an apocalyptic number.
106443470143 is a deficient number, since it is larger than the sum of its proper divisors (1).
106443470143 is an equidigital number, since it uses as much as digits as its factorization.
106443470143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 37.
The spelling of 106443470143 in words is "one hundred six billion, four hundred forty-three million, four hundred seventy thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •